./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 54858612 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 faad93e560ba524ae1ece04545479d8bfc495d5f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 23:09:33,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:09:33,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:09:33,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:09:33,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:09:33,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:09:33,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:09:33,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:09:33,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:09:33,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:09:33,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:09:33,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:09:33,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:09:33,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:09:33,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:09:33,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:09:33,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:09:33,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:09:33,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:09:33,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:09:33,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:09:33,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:09:33,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:09:33,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:09:33,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:09:33,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:09:33,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:09:33,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:09:33,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:09:33,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:09:33,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:09:33,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:09:33,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:09:33,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:09:33,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:09:33,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:09:33,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:09:33,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:09:33,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:09:33,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:09:33,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:09:33,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:09:33,807 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:09:33,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:09:33,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:09:33,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:09:33,811 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:09:33,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:09:33,812 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:09:33,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:09:33,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:09:33,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:09:33,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:09:33,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:09:33,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:09:33,814 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:09:33,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:09:33,815 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:09:33,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:09:33,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:09:33,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:09:33,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:09:33,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:09:33,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:09:33,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:09:33,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:09:33,818 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 -> faad93e560ba524ae1ece04545479d8bfc495d5f [2020-10-25 23:09:34,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:09:34,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:09:34,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:09:34,364 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:09:34,366 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:09:34,368 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 [2020-10-25 23:09:34,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea9fee57/3a22655906f846378829822eb0c8a554/FLAG60b162576 [2020-10-25 23:09:35,130 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:09:35,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2020-10-25 23:09:35,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea9fee57/3a22655906f846378829822eb0c8a554/FLAG60b162576 [2020-10-25 23:09:35,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ea9fee57/3a22655906f846378829822eb0c8a554 [2020-10-25 23:09:35,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:09:35,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:09:35,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:09:35,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:09:35,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:09:35,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@250caf10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35, skipping insertion in model container [2020-10-25 23:09:35,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:09:35,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:09:35,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:09:35,792 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:09:35,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:09:35,831 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:09:35,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35 WrapperNode [2020-10-25 23:09:35,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:09:35,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:09:35,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:09:35,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:09:35,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:09:35,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:09:35,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:09:35,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:09:35,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... [2020-10-25 23:09:35,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:09:35,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:09:35,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:09:35,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:09:35,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:09:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:09:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:09:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:09:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:09:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-25 23:09:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-25 23:09:36,366 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:09:36,366 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-25 23:09:36,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:36 BoogieIcfgContainer [2020-10-25 23:09:36,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:09:36,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:09:36,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:09:36,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:09:36,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:09:35" (1/3) ... [2020-10-25 23:09:36,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e763ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:09:36, skipping insertion in model container [2020-10-25 23:09:36,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:09:35" (2/3) ... [2020-10-25 23:09:36,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e763ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:09:36, skipping insertion in model container [2020-10-25 23:09:36,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:36" (3/3) ... [2020-10-25 23:09:36,380 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-10-25 23:09:36,406 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:09:36,418 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:09:36,454 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:09:36,500 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:09:36,501 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:09:36,501 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:09:36,501 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:09:36,501 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:09:36,501 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:09:36,501 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:09:36,501 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:09:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-10-25 23:09:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 23:09:36,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:36,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:36,527 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -730685886, now seen corresponding path program 1 times [2020-10-25 23:09:36,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:36,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090339876] [2020-10-25 23:09:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:36,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:09:36,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090339876] [2020-10-25 23:09:36,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:09:36,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:09:36,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827093111] [2020-10-25 23:09:36,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:09:36,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:09:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:09:36,852 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-10-25 23:09:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:36,928 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-10-25 23:09:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:09:36,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-25 23:09:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:36,941 INFO L225 Difference]: With dead ends: 35 [2020-10-25 23:09:36,941 INFO L226 Difference]: Without dead ends: 18 [2020-10-25 23:09:36,945 INFO L677 BasicCegarLoop]: 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 [2020-10-25 23:09:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-25 23:09:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-25 23:09:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:09:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:09:37,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-10-25 23:09:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:37,010 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:09:37,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:09:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:09:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 23:09:37,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:37,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:37,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:09:37,013 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -461623668, now seen corresponding path program 1 times [2020-10-25 23:09:37,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:37,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119624033] [2020-10-25 23:09:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:09:37,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119624033] [2020-10-25 23:09:37,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:09:37,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:09:37,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367485066] [2020-10-25 23:09:37,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:09:37,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:37,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:09:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:09:37,164 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-10-25 23:09:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:37,204 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-25 23:09:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:09:37,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 23:09:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:37,207 INFO L225 Difference]: With dead ends: 24 [2020-10-25 23:09:37,207 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:09:37,208 INFO L677 BasicCegarLoop]: 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 [2020-10-25 23:09:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:09:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-25 23:09:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:09:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:09:37,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-10-25 23:09:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:37,217 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:09:37,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:09:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:09:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 23:09:37,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:37,219 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:37,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:09:37,220 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:37,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1253239047, now seen corresponding path program 1 times [2020-10-25 23:09:37,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:37,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663266571] [2020-10-25 23:09:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-25 23:09:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:09:37,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663266571] [2020-10-25 23:09:37,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788382627] [2020-10-25 23:09:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:09:37,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:09:37,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:37,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-25 23:09:37,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397455808] [2020-10-25 23:09:37,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 23:09:37,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 23:09:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:09:37,571 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-10-25 23:09:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:37,715 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-10-25 23:09:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 23:09:37,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-25 23:09:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:37,717 INFO L225 Difference]: With dead ends: 35 [2020-10-25 23:09:37,717 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:09:37,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:09:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:09:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-25 23:09:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-25 23:09:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-10-25 23:09:37,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-10-25 23:09:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:37,726 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-25 23:09:37,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 23:09:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-10-25 23:09:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 23:09:37,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:37,728 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:37,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 23:09:37,942 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1685451365, now seen corresponding path program 1 times [2020-10-25 23:09:37,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:37,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799459629] [2020-10-25 23:09:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:37,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:09:38,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799459629] [2020-10-25 23:09:38,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30428343] [2020-10-25 23:09:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:09:38,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:09:38,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:38,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-25 23:09:38,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318658722] [2020-10-25 23:09:38,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 23:09:38,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 23:09:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:09:38,227 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-10-25 23:09:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:38,373 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-10-25 23:09:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:09:38,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-25 23:09:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:38,378 INFO L225 Difference]: With dead ends: 38 [2020-10-25 23:09:38,378 INFO L226 Difference]: Without dead ends: 34 [2020-10-25 23:09:38,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:09:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-25 23:09:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-25 23:09:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-25 23:09:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-10-25 23:09:38,400 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-10-25 23:09:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:38,401 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-10-25 23:09:38,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 23:09:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-10-25 23:09:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 23:09:38,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:38,407 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:38,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:38,621 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:38,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 228714308, now seen corresponding path program 2 times [2020-10-25 23:09:38,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:38,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610659763] [2020-10-25 23:09:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 23:09:38,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610659763] [2020-10-25 23:09:38,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946093949] [2020-10-25 23:09:38,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:38,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 23:09:38,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:38,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:09:38,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 23:09:38,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:38,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-25 23:09:38,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548087750] [2020-10-25 23:09:38,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 23:09:38,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:38,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 23:09:38,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:09:38,980 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-10-25 23:09:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:39,261 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-10-25 23:09:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 23:09:39,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-10-25 23:09:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:39,264 INFO L225 Difference]: With dead ends: 69 [2020-10-25 23:09:39,264 INFO L226 Difference]: Without dead ends: 38 [2020-10-25 23:09:39,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:09:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-25 23:09:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-25 23:09:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-25 23:09:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-10-25 23:09:39,274 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-10-25 23:09:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:39,275 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-10-25 23:09:39,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 23:09:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-10-25 23:09:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 23:09:39,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:39,278 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:39,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:39,492 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:39,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1825869943, now seen corresponding path program 3 times [2020-10-25 23:09:39,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:39,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674337098] [2020-10-25 23:09:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-10-25 23:09:39,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674337098] [2020-10-25 23:09:39,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366983870] [2020-10-25 23:09:39,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:39,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-25 23:09:39,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:09:39,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-10-25 23:09:39,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:39,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-10-25 23:09:39,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562946747] [2020-10-25 23:09:39,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:09:39,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:39,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:09:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:09:39,960 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-10-25 23:09:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:40,272 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-10-25 23:09:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 23:09:40,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-25 23:09:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:40,277 INFO L225 Difference]: With dead ends: 94 [2020-10-25 23:09:40,277 INFO L226 Difference]: Without dead ends: 90 [2020-10-25 23:09:40,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:09:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-25 23:09:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-10-25 23:09:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:09:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-10-25 23:09:40,301 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-10-25 23:09:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:40,302 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-10-25 23:09:40,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:09:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-10-25 23:09:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-25 23:09:40,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:40,308 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:40,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:40,520 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -793137460, now seen corresponding path program 4 times [2020-10-25 23:09:40,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:40,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097912622] [2020-10-25 23:09:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:40,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-10-25 23:09:41,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097912622] [2020-10-25 23:09:41,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963007610] [2020-10-25 23:09:41,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:41,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 23:09:41,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:41,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 23:09:41,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-10-25 23:09:41,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:41,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-10-25 23:09:41,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573318437] [2020-10-25 23:09:41,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 23:09:41,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:41,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 23:09:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-25 23:09:41,669 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 17 states. [2020-10-25 23:09:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:42,512 INFO L93 Difference]: Finished difference Result 169 states and 322 transitions. [2020-10-25 23:09:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-25 23:09:42,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2020-10-25 23:09:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:42,520 INFO L225 Difference]: With dead ends: 169 [2020-10-25 23:09:42,520 INFO L226 Difference]: Without dead ends: 91 [2020-10-25 23:09:42,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-10-25 23:09:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-25 23:09:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2020-10-25 23:09:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:09:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-25 23:09:42,565 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 201 [2020-10-25 23:09:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:42,567 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-25 23:09:42,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 23:09:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-25 23:09:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-10-25 23:09:42,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:42,576 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:42,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 23:09:42,790 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash 207835975, now seen corresponding path program 5 times [2020-10-25 23:09:42,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:42,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388843938] [2020-10-25 23:09:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:42,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:43,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-10-25 23:09:44,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388843938] [2020-10-25 23:09:44,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302369595] [2020-10-25 23:09:44,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:44,245 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2020-10-25 23:09:44,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:44,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-25 23:09:44,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1321 proven. 1303 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2020-10-25 23:09:44,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:44,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2020-10-25 23:09:44,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102636405] [2020-10-25 23:09:44,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-25 23:09:44,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-25 23:09:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-25 23:09:44,582 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 21 states. [2020-10-25 23:09:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:45,670 INFO L93 Difference]: Finished difference Result 185 states and 315 transitions. [2020-10-25 23:09:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-25 23:09:45,672 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 351 [2020-10-25 23:09:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:45,679 INFO L225 Difference]: With dead ends: 185 [2020-10-25 23:09:45,679 INFO L226 Difference]: Without dead ends: 112 [2020-10-25 23:09:45,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=429, Invalid=1641, Unknown=0, NotChecked=0, Total=2070 [2020-10-25 23:09:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-25 23:09:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2020-10-25 23:09:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-25 23:09:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2020-10-25 23:09:45,726 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 351 [2020-10-25 23:09:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:45,728 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2020-10-25 23:09:45,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-25 23:09:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2020-10-25 23:09:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2020-10-25 23:09:45,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:45,746 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:45,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:45,960 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 216740681, now seen corresponding path program 6 times [2020-10-25 23:09:45,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:45,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628028793] [2020-10-25 23:09:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:46,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:09:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:47,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1851 proven. 3572 refuted. 0 times theorem prover too weak. 13680 trivial. 0 not checked. [2020-10-25 23:09:48,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628028793] [2020-10-25 23:09:48,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720146046] [2020-10-25 23:09:48,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:48,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-10-25 23:09:48,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:09:48,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-25 23:09:48,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 709 proven. 2234 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2020-10-25 23:09:48,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:48,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 21 [2020-10-25 23:09:48,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897116822] [2020-10-25 23:09:48,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-25 23:09:48,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:48,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-25 23:09:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-10-25 23:09:48,734 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand 21 states. [2020-10-25 23:09:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:50,005 INFO L93 Difference]: Finished difference Result 223 states and 380 transitions. [2020-10-25 23:09:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-10-25 23:09:50,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 569 [2020-10-25 23:09:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:50,017 INFO L225 Difference]: With dead ends: 223 [2020-10-25 23:09:50,017 INFO L226 Difference]: Without dead ends: 133 [2020-10-25 23:09:50,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2020-10-25 23:09:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-25 23:09:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 118. [2020-10-25 23:09:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-25 23:09:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2020-10-25 23:09:50,067 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 569 [2020-10-25 23:09:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:50,068 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2020-10-25 23:09:50,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-25 23:09:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2020-10-25 23:09:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2020-10-25 23:09:50,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:50,100 INFO L422 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:50,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:50,307 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1857071404, now seen corresponding path program 7 times [2020-10-25 23:09:50,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:50,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667566145] [2020-10-25 23:09:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:51,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:51,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:51,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:51,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:51,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:09:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-10-25 23:09:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:52,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:09:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:09:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:09:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:09:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:53,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 6004 proven. 6094 refuted. 0 times theorem prover too weak. 31516 trivial. 0 not checked. [2020-10-25 23:09:54,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667566145] [2020-10-25 23:09:54,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508290651] [2020-10-25 23:09:54,449 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:09:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:54,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1928 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-25 23:09:54,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:09:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2020-10-25 23:09:55,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:09:55,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 23 [2020-10-25 23:09:55,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146605016] [2020-10-25 23:09:55,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-25 23:09:55,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:09:55,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-25 23:09:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2020-10-25 23:09:55,275 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand 23 states. [2020-10-25 23:09:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:09:56,918 INFO L93 Difference]: Finished difference Result 276 states and 506 transitions. [2020-10-25 23:09:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-10-25 23:09:56,920 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 855 [2020-10-25 23:09:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:09:56,926 INFO L225 Difference]: With dead ends: 276 [2020-10-25 23:09:56,927 INFO L226 Difference]: Without dead ends: 169 [2020-10-25 23:09:56,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=628, Invalid=2564, Unknown=0, NotChecked=0, Total=3192 [2020-10-25 23:09:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-25 23:09:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2020-10-25 23:09:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-25 23:09:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 227 transitions. [2020-10-25 23:09:56,952 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 227 transitions. Word has length 855 [2020-10-25 23:09:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:09:56,954 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 227 transitions. [2020-10-25 23:09:56,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-25 23:09:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 227 transitions. [2020-10-25 23:09:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1387 [2020-10-25 23:09:57,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:09:57,024 INFO L422 BasicCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:09:57,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-25 23:09:57,238 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:09:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:09:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash -781134937, now seen corresponding path program 8 times [2020-10-25 23:09:57,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:09:57,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51101756] [2020-10-25 23:09:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:09:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:58,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:09:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:09:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:09:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:09:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:09:59,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:09:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:10:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:10:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-10-25 23:10:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:10:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:00,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2020-10-25 23:10:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:01,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:10:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-25 23:10:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-10-25 23:10:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:10:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:10:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:10:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:10:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:10:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:02,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:10:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:10:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 11745 proven. 12042 refuted. 0 times theorem prover too weak. 91791 trivial. 0 not checked. [2020-10-25 23:10:04,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51101756] [2020-10-25 23:10:04,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812861628] [2020-10-25 23:10:04,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:10:05,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 23:10:05,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:10:05,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 3107 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-25 23:10:05,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:10:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6850 proven. 3999 refuted. 0 times theorem prover too weak. 104729 trivial. 0 not checked. [2020-10-25 23:10:06,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:10:06,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 27 [2020-10-25 23:10:06,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107604261] [2020-10-25 23:10:06,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-25 23:10:06,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:10:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-25 23:10:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2020-10-25 23:10:06,459 INFO L87 Difference]: Start difference. First operand 147 states and 227 transitions. Second operand 27 states. [2020-10-25 23:10:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:10:08,679 INFO L93 Difference]: Finished difference Result 343 states and 694 transitions. [2020-10-25 23:10:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-10-25 23:10:08,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1386 [2020-10-25 23:10:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:10:08,693 INFO L225 Difference]: With dead ends: 343 [2020-10-25 23:10:08,694 INFO L226 Difference]: Without dead ends: 187 [2020-10-25 23:10:08,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1862 GetRequests, 1796 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=836, Invalid=3720, Unknown=0, NotChecked=0, Total=4556 [2020-10-25 23:10:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-25 23:10:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2020-10-25 23:10:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-10-25 23:10:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2020-10-25 23:10:08,730 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1386 [2020-10-25 23:10:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:10:08,736 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2020-10-25 23:10:08,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-25 23:10:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2020-10-25 23:10:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2020-10-25 23:10:08,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:10:08,752 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:10:08,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:10:08,965 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:10:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:10:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -151362644, now seen corresponding path program 9 times [2020-10-25 23:10:08,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:10:08,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606300610] [2020-10-25 23:10:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:10:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:10:09,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:10:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:10:09,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:10:10,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:10:10,244 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:10:10,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:10:10,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:10:10 BoogieIcfgContainer [2020-10-25 23:10:10,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:10:10,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:10:10,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:10:10,583 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:10:10,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:09:36" (3/4) ... [2020-10-25 23:10:10,586 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:10:10,941 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:10:10,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:10:10,946 INFO L168 Benchmark]: Toolchain (without parser) took 35452.48 ms. Allocated memory was 46.1 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 23.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 88.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,947 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 46.1 MB. Free memory is still 31.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:10:10,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.88 ms. Allocated memory is still 46.1 MB. Free memory was 23.3 MB in the beginning and 25.5 MB in the end (delta: -2.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 46.1 MB. Free memory was 25.5 MB in the beginning and 24.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:10:10,950 INFO L168 Benchmark]: Boogie Preprocessor took 23.06 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 23.4 MB in the end (delta: 866.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,952 INFO L168 Benchmark]: RCFGBuilder took 468.91 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 23.7 MB in the end (delta: -469.6 kB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,953 INFO L168 Benchmark]: TraceAbstraction took 34210.41 ms. Allocated memory was 46.1 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 23.3 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 996.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,953 INFO L168 Benchmark]: Witness Printer took 359.73 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2020-10-25 23:10:10,955 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.37 ms. Allocated memory is still 46.1 MB. Free memory is still 31.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 333.88 ms. Allocated memory is still 46.1 MB. Free memory was 23.3 MB in the beginning and 25.5 MB in the end (delta: -2.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 46.1 MB. Free memory was 25.5 MB in the beginning and 24.2 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.06 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 23.4 MB in the end (delta: 866.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 468.91 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 23.7 MB in the end (delta: -469.6 kB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 34210.41 ms. Allocated memory was 46.1 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 23.3 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 996.6 MB. Max. memory is 16.1 GB. * Witness Printer took 359.73 ms. Allocated memory is still 2.0 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int 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) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L4] __assert_fail("0", "fibo_10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.7s, OverallIterations: 12, TraceHistogramMax: 203, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 294 SDtfs, 1305 SDslu, 1034 SDs, 0 SdLazy, 3194 SolverSat, 1447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4862 GetRequests, 4559 SyntacticMatches, 2 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3277 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 8280 NumberOfCodeBlocks, 7766 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 7051 ConstructedInterpolants, 0 QuantifiedInterpolants, 7714425 SizeOfPredicates, 62 NumberOfNonLiveVariables, 6875 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 338425/376048 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! Received shutdown request...