./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_10-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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:27:12,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:27:12,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:27:12,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:27:12,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:27:12,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:27:12,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:27:12,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:27:12,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:27:12,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:27:12,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:27:12,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:27:12,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:27:12,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:27:12,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:27:12,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:27:12,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:27:12,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:27:12,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:27:12,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:27:12,820 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:27:12,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:27:12,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:27:12,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:27:12,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:27:12,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:27:12,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:27:12,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:27:12,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:27:12,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:27:12,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:27:12,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:27:12,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:27:12,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:27:12,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:27:12,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:27:12,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:27:12,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:27:12,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:27:12,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:27:12,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:27:12,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:27:12,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:27:12,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:27:12,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:27:12,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:27:12,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:27:12,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:27:12,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:27:12,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:27:12,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:27:12,867 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:27:12,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:27:12,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:27:12,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:27:12,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:27:12,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:27:12,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:27:12,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:27:12,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:27:12,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:27:12,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:27:12,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:27:12,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:27:12,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:27:12,872 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2022-07-19 17:27:13,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:27:13,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:27:13,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:27:13,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:27:13,126 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:27:13,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-07-19 17:27:13,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bcd8fdb3/74d8ead785ab43a994785ae73bcb48e4/FLAGad891d74e [2022-07-19 17:27:13,564 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:27:13,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-07-19 17:27:13,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bcd8fdb3/74d8ead785ab43a994785ae73bcb48e4/FLAGad891d74e [2022-07-19 17:27:13,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bcd8fdb3/74d8ead785ab43a994785ae73bcb48e4 [2022-07-19 17:27:13,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:27:13,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:27:13,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:27:13,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:27:13,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:27:13,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2506326c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13, skipping insertion in model container [2022-07-19 17:27:13,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:27:13,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:27:13,759 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_10-1.c[743,756] [2022-07-19 17:27:13,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:27:13,769 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:27:13,779 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_10-1.c[743,756] [2022-07-19 17:27:13,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:27:13,788 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:27:13,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13 WrapperNode [2022-07-19 17:27:13,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:27:13,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:27:13,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:27:13,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:27:13,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,811 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-19 17:27:13,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:27:13,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:27:13,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:27:13,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:27:13,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:27:13,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:27:13,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:27:13,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:27:13,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (1/1) ... [2022-07-19 17:27:13,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:27:13,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:13,854 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-07-19 17:27:13,876 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-07-19 17:27:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:27:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:27:13,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:27:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:27:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-07-19 17:27:13,914 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-07-19 17:27:13,958 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:27:13,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:27:14,043 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:27:14,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:27:14,063 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:27:14,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:14 BoogieIcfgContainer [2022-07-19 17:27:14,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:27:14,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:27:14,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:27:14,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:27:14,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:27:13" (1/3) ... [2022-07-19 17:27:14,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae13325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:27:14, skipping insertion in model container [2022-07-19 17:27:14,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:27:13" (2/3) ... [2022-07-19 17:27:14,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae13325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:27:14, skipping insertion in model container [2022-07-19 17:27:14,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:14" (3/3) ... [2022-07-19 17:27:14,070 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-07-19 17:27:14,079 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:27:14,079 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:27:14,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:27:14,133 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46e70df2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31de2da0 [2022-07-19 17:27:14,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:27:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:27:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 17:27:14,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:14,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:14,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-07-19 17:27:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:14,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952190412] [2022-07-19 17:27:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:14,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:27:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:14,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952190412] [2022-07-19 17:27:14,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952190412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:27:14,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:27:14,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:27:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391301196] [2022-07-19 17:27:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:27:14,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:27:14,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:27:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:14,424 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-07-19 17:27:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:14,475 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-19 17:27:14,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:27:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-07-19 17:27:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:14,483 INFO L225 Difference]: With dead ends: 34 [2022-07-19 17:27:14,484 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 17:27:14,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:14,491 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:14,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:27:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 17:27:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-19 17:27:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 17:27:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-19 17:27:14,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-19 17:27:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:14,530 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-19 17:27:14,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-07-19 17:27:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-19 17:27:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 17:27:14,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:14,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:14,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:27:14,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-07-19 17:27:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036326276] [2022-07-19 17:27:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:27:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:14,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036326276] [2022-07-19 17:27:14,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036326276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:27:14,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:27:14,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:27:14,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210310392] [2022-07-19 17:27:14,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:27:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:27:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:27:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:14,656 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:27:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:14,687 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-19 17:27:14,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:27:14,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-19 17:27:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:14,688 INFO L225 Difference]: With dead ends: 24 [2022-07-19 17:27:14,688 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 17:27:14,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:14,693 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:14,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:27:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 17:27:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-19 17:27:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 17:27:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-19 17:27:14,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-19 17:27:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:14,697 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-19 17:27:14,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:27:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-19 17:27:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 17:27:14,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:14,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:14,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:27:14,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-07-19 17:27:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:14,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730444722] [2022-07-19 17:27:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 17:27:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:27:14,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:14,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730444722] [2022-07-19 17:27:14,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730444722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:14,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4831506] [2022-07-19 17:27:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:14,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:14,803 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-07-19 17:27:14,804 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-07-19 17:27:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:14,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:27:14,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:27:14,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 17:27:15,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4831506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:15,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:15,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-07-19 17:27:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014420100] [2022-07-19 17:27:15,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 17:27:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 17:27:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:27:15,205 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 17:27:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:15,321 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-07-19 17:27:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 17:27:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-07-19 17:27:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:15,322 INFO L225 Difference]: With dead ends: 35 [2022-07-19 17:27:15,322 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 17:27:15,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:27:15,323 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:15,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 17:27:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 17:27:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 17:27:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-19 17:27:15,328 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-07-19 17:27:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:15,328 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-19 17:27:15,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 17:27:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-19 17:27:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 17:27:15,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:15,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:15,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:15,548 WARN L477 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-07-19 17:27:15,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-07-19 17:27:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:15,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932303255] [2022-07-19 17:27:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:15,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:15,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:27:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:15,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932303255] [2022-07-19 17:27:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932303255] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:15,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624922936] [2022-07-19 17:27:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:15,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:15,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:27:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:15,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:27:15,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:27:15,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 17:27:15,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624922936] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:15,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:15,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-19 17:27:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657405488] [2022-07-19 17:27:15,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 17:27:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 17:27:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:27:15,903 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 17:27:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:16,013 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-19 17:27:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:27:16,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-07-19 17:27:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:16,018 INFO L225 Difference]: With dead ends: 38 [2022-07-19 17:27:16,018 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 17:27:16,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:27:16,041 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:16,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 17:27:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-19 17:27:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-19 17:27:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-19 17:27:16,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-07-19 17:27:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:16,081 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-19 17:27:16,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 17:27:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-19 17:27:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 17:27:16,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:16,083 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:16,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:16,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 17:27:16,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-07-19 17:27:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411889792] [2022-07-19 17:27:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:27:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:16,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411889792] [2022-07-19 17:27:16,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411889792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965511169] [2022-07-19 17:27:16,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:27:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:16,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:16,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:27:16,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:27:16,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:16,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:27:16,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 17:27:16,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 17:27:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965511169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:16,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:16,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-07-19 17:27:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965309262] [2022-07-19 17:27:16,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 17:27:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 17:27:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:27:16,858 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-19 17:27:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:17,007 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-07-19 17:27:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 17:27:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-07-19 17:27:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:17,008 INFO L225 Difference]: With dead ends: 69 [2022-07-19 17:27:17,008 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 17:27:17,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:27:17,009 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:17,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 17:27:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-19 17:27:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 17:27:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-19 17:27:17,014 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-19 17:27:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:17,014 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-19 17:27:17,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-19 17:27:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-19 17:27:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 17:27:17,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:17,016 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:17,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 17:27:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:17,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-07-19 17:27:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:17,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369636437] [2022-07-19 17:27:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 17:27:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:17,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369636437] [2022-07-19 17:27:17,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369636437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:17,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603261774] [2022-07-19 17:27:17,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:27:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:17,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:17,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:17,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:27:17,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 17:27:17,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:17,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:27:17,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 17:27:17,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-19 17:27:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603261774] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:17,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-07-19 17:27:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941688027] [2022-07-19 17:27:17,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:17,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 17:27:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 17:27:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:27:17,850 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-19 17:27:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:17,960 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-07-19 17:27:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:27:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2022-07-19 17:27:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:17,964 INFO L225 Difference]: With dead ends: 85 [2022-07-19 17:27:17,965 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 17:27:17,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-07-19 17:27:17,969 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:17,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 67 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 17:27:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-19 17:27:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-19 17:27:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-07-19 17:27:17,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-07-19 17:27:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:17,981 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-07-19 17:27:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-19 17:27:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-07-19 17:27:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 17:27:17,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:17,987 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:18,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:18,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:18,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-07-19 17:27:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:18,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896389501] [2022-07-19 17:27:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-19 17:27:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896389501] [2022-07-19 17:27:18,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896389501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:18,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869731883] [2022-07-19 17:27:18,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 17:27:18,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:18,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:18,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:27:18,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 17:27:18,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:18,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:27:18,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-19 17:27:18,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2022-07-19 17:27:19,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869731883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:19,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:19,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-07-19 17:27:19,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862758101] [2022-07-19 17:27:19,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:19,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 17:27:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 17:27:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:27:19,322 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-19 17:27:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:19,478 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-07-19 17:27:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:27:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2022-07-19 17:27:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:19,483 INFO L225 Difference]: With dead ends: 117 [2022-07-19 17:27:19,483 INFO L226 Difference]: Without dead ends: 113 [2022-07-19 17:27:19,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-19 17:27:19,484 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:19,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:27:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-19 17:27:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-07-19 17:27:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2022-07-19 17:27:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-07-19 17:27:19,497 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-07-19 17:27:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:19,498 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-07-19 17:27:19,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-19 17:27:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-07-19 17:27:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 17:27:19,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:19,500 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:19,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 17:27:19,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:19,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-07-19 17:27:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:19,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93002522] [2022-07-19 17:27:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2022-07-19 17:27:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93002522] [2022-07-19 17:27:20,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93002522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103691397] [2022-07-19 17:27:20,150 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 17:27:20,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:20,152 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:20,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:27:20,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-19 17:27:20,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:20,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:27:20,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2022-07-19 17:27:20,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-07-19 17:27:22,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103691397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:22,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:22,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-07-19 17:27:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743211994] [2022-07-19 17:27:22,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:22,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 17:27:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:22,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 17:27:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 17:27:22,191 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-19 17:27:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:22,749 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-07-19 17:27:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 17:27:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2022-07-19 17:27:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:22,754 INFO L225 Difference]: With dead ends: 193 [2022-07-19 17:27:22,754 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 17:27:22,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2022-07-19 17:27:22,764 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:22,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:27:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 17:27:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-07-19 17:27:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-19 17:27:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-07-19 17:27:22,815 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-07-19 17:27:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:22,816 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-19 17:27:22,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-19 17:27:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-07-19 17:27:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-19 17:27:22,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:22,818 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:22,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:23,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:23,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-07-19 17:27:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:23,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207368178] [2022-07-19 17:27:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-07-19 17:27:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:23,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207368178] [2022-07-19 17:27:23,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207368178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:23,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011137793] [2022-07-19 17:27:23,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 17:27:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:23,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:23,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 17:27:23,789 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-07-19 17:27:23,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:23,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 17:27:23,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2022-07-19 17:27:23,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 335 proven. 857 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2022-07-19 17:27:25,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011137793] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:25,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2022-07-19 17:27:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946982768] [2022-07-19 17:27:25,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:25,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 17:27:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 17:27:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-07-19 17:27:25,504 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-19 17:27:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:25,848 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-07-19 17:27:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:27:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) Word has length 283 [2022-07-19 17:27:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:25,853 INFO L225 Difference]: With dead ends: 266 [2022-07-19 17:27:25,853 INFO L226 Difference]: Without dead ends: 262 [2022-07-19 17:27:25,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-07-19 17:27:25,855 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:25,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 102 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:27:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-19 17:27:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2022-07-19 17:27:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 170 states have (on average 1.035294117647059) internal successors, (176), 165 states have internal predecessors, (176), 52 states have call successors, (52), 31 states have call predecessors, (52), 24 states have return successors, (140), 50 states have call predecessors, (140), 52 states have call successors, (140) [2022-07-19 17:27:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2022-07-19 17:27:25,885 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2022-07-19 17:27:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:25,886 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2022-07-19 17:27:25,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-19 17:27:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2022-07-19 17:27:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-07-19 17:27:25,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:25,904 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:25,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:26,123 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2022-07-19 17:27:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811127428] [2022-07-19 17:27:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:27:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-07-19 17:27:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811127428] [2022-07-19 17:27:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811127428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722490993] [2022-07-19 17:27:27,145 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 17:27:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:27,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:27,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:27,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 17:27:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:27,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 17:27:27,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2022-07-19 17:27:27,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2766 refuted. 0 times theorem prover too weak. 13255 trivial. 0 not checked. [2022-07-19 17:27:30,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722490993] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:30,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:30,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2022-07-19 17:27:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182663970] [2022-07-19 17:27:30,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:30,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 17:27:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:30,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 17:27:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 17:27:30,177 INFO L87 Difference]: Start difference. First operand 247 states and 368 transitions. Second operand has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-07-19 17:27:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:30,949 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2022-07-19 17:27:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 17:27:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) Word has length 528 [2022-07-19 17:27:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:30,952 INFO L225 Difference]: With dead ends: 388 [2022-07-19 17:27:30,952 INFO L226 Difference]: Without dead ends: 152 [2022-07-19 17:27:30,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2022-07-19 17:27:30,955 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 227 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:27:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-19 17:27:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2022-07-19 17:27:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 85 states have internal predecessors, (90), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (58), 17 states have call predecessors, (58), 24 states have call successors, (58) [2022-07-19 17:27:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-07-19 17:27:30,972 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2022-07-19 17:27:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:30,973 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-07-19 17:27:30,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-07-19 17:27:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-07-19 17:27:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-07-19 17:27:30,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:30,988 INFO L195 NwaCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:31,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:31,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 17:27:31,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2022-07-19 17:27:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:31,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762915670] [2022-07-19 17:27:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:31,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:27:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-19 17:27:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:27:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2022-07-19 17:27:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:32,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762915670] [2022-07-19 17:27:32,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762915670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:32,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281837133] [2022-07-19 17:27:32,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:27:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:32,909 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:32,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 17:27:33,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:27:33,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:33,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:27:33,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2022-07-19 17:27:33,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5245 refuted. 0 times theorem prover too weak. 37670 trivial. 0 not checked. [2022-07-19 17:27:37,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281837133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:37,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2022-07-19 17:27:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312549808] [2022-07-19 17:27:37,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:37,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 17:27:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 17:27:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 17:27:37,493 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-07-19 17:27:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:38,705 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2022-07-19 17:27:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 17:27:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) Word has length 855 [2022-07-19 17:27:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:38,750 INFO L225 Difference]: With dead ends: 270 [2022-07-19 17:27:38,750 INFO L226 Difference]: Without dead ends: 163 [2022-07-19 17:27:38,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1957 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2022-07-19 17:27:38,752 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:38,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 222 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 17:27:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-19 17:27:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-19 17:27:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 97 states have internal predecessors, (102), 28 states have call successors, (28), 22 states have call predecessors, (28), 11 states have return successors, (71), 19 states have call predecessors, (71), 28 states have call successors, (71) [2022-07-19 17:27:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2022-07-19 17:27:38,767 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2022-07-19 17:27:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:38,768 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-07-19 17:27:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-07-19 17:27:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2022-07-19 17:27:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2022-07-19 17:27:38,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:38,789 INFO L195 NwaCegarLoop]: trace histogram [229, 229, 185, 114, 114, 114, 114, 114, 114, 114, 71, 44, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:38,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:39,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:39,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2022-07-19 17:27:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:39,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182582224] [2022-07-19 17:27:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:27:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:27:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-19 17:27:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-07-19 17:27:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:27:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-19 17:27:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-19 17:27:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2022-07-19 17:27:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 17:27:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 17:27:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:27:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:27:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 17:27:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 13165 proven. 14022 refuted. 0 times theorem prover too weak. 120021 trivial. 0 not checked. [2022-07-19 17:27:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:42,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182582224] [2022-07-19 17:27:42,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182582224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:42,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699964865] [2022-07-19 17:27:42,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:27:42,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:42,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:42,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 17:27:43,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2022-07-19 17:27:43,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:43,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 17:27:43,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1070 refuted. 0 times theorem prover too weak. 135392 trivial. 0 not checked. [2022-07-19 17:27:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1120 refuted. 0 times theorem prover too weak. 135342 trivial. 0 not checked. [2022-07-19 17:27:47,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699964865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:47,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:47,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2022-07-19 17:27:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905870041] [2022-07-19 17:27:47,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:47,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-19 17:27:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-19 17:27:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2022-07-19 17:27:47,662 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-07-19 17:27:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:48,522 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2022-07-19 17:27:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-19 17:27:48,522 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1563 [2022-07-19 17:27:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:48,525 INFO L225 Difference]: With dead ends: 319 [2022-07-19 17:27:48,525 INFO L226 Difference]: Without dead ends: 195 [2022-07-19 17:27:48,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3580 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2022-07-19 17:27:48,528 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:48,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 277 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:27:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-19 17:27:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2022-07-19 17:27:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 110 states have internal predecessors, (115), 33 states have call successors, (33), 26 states have call predecessors, (33), 11 states have return successors, (84), 20 states have call predecessors, (84), 33 states have call successors, (84) [2022-07-19 17:27:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2022-07-19 17:27:48,540 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2022-07-19 17:27:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:48,541 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2022-07-19 17:27:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-07-19 17:27:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2022-07-19 17:27:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-07-19 17:27:48,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:48,551 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:48,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:48,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 17:27:48,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2022-07-19 17:27:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:48,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980045299] [2022-07-19 17:27:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:27:48,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:27:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:27:49,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:27:49,270 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:27:49,271 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:27:49,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 17:27:49,274 INFO L356 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-07-19 17:27:49,279 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:27:49,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:27:49 BoogieIcfgContainer [2022-07-19 17:27:49,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:27:49,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:27:49,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:27:49,418 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:27:49,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:27:14" (3/4) ... [2022-07-19 17:27:49,419 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:27:49,530 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:27:49,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:27:49,531 INFO L158 Benchmark]: Toolchain (without parser) took 35945.08ms. Allocated memory was 88.1MB in the beginning and 474.0MB in the end (delta: 385.9MB). Free memory was 50.2MB in the beginning and 201.9MB in the end (delta: -151.7MB). Peak memory consumption was 233.0MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,531 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:49,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.87ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 64.7MB in the end (delta: -14.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.86ms. Allocated memory is still 88.1MB. Free memory was 64.7MB in the beginning and 63.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,532 INFO L158 Benchmark]: Boogie Preprocessor took 15.67ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 62.4MB in the end (delta: 855.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:49,533 INFO L158 Benchmark]: RCFGBuilder took 236.27ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 53.9MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,533 INFO L158 Benchmark]: TraceAbstraction took 35350.79ms. Allocated memory was 88.1MB in the beginning and 474.0MB in the end (delta: 385.9MB). Free memory was 53.3MB in the beginning and 227.1MB in the end (delta: -173.7MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,533 INFO L158 Benchmark]: Witness Printer took 113.02ms. Allocated memory is still 474.0MB. Free memory was 227.1MB in the beginning and 201.9MB in the end (delta: 25.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:49,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.87ms. Allocated memory is still 88.1MB. Free memory was 50.0MB in the beginning and 64.7MB in the end (delta: -14.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.86ms. Allocated memory is still 88.1MB. Free memory was 64.7MB in the beginning and 63.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.67ms. Allocated memory is still 88.1MB. Free memory was 63.3MB in the beginning and 62.4MB in the end (delta: 855.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.27ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 53.9MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35350.79ms. Allocated memory was 88.1MB in the beginning and 474.0MB in the end (delta: 385.9MB). Free memory was 53.3MB in the beginning and 227.1MB in the end (delta: -173.7MB). Peak memory consumption was 218.4MB. Max. memory is 16.1GB. * Witness Printer took 113.02ms. Allocated memory is still 474.0MB. Free memory was 227.1MB in the beginning and 201.9MB in the end (delta: 25.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1740 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 2323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3196 IncrementalHoareTripleChecker+Invalid, 5519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2323 mSolverCounterUnsat, 274 mSDtfsCounter, 3196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8889 GetRequests, 8504 SyntacticMatches, 17 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6064 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 8710 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 11209 ConstructedInterpolants, 0 QuantifiedInterpolants, 15460 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6571 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 600612/647382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 17:27:49,584 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE