./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b225e80ee922ecd6d28f97f9a97339f737a7de4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 11:00:33,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:00:33,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:00:33,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:00:33,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:00:33,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:00:33,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:00:33,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:00:33,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:00:33,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:00:33,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:00:33,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:00:33,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:00:33,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:00:33,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:00:33,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:00:33,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:00:33,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:00:33,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:00:33,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:00:33,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:00:33,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:00:33,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:00:33,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:00:33,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:00:33,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:00:33,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:00:33,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:00:33,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:00:33,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:00:33,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:00:33,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:00:33,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:00:33,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:00:33,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:00:33,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:00:33,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:00:33,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:00:33,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:00:33,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:00:33,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:00:33,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:00:33,134 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:00:33,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:00:33,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:00:33,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:00:33,136 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:00:33,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:00:33,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:00:33,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:00:33,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:00:33,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:00:33,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:00:33,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:00:33,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:00:33,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:00:33,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:00:33,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:00:33,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:00:33,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:00:33,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:00:33,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:00:33,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:00:33,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:00:33,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:00:33,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:00:33,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:00:33,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:00:33,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:00:33,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:00:33,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:00:33,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer 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(__VERIFIER_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 -> 7b225e80ee922ecd6d28f97f9a97339f737a7de4 [2019-12-07 11:00:33,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:00:33,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:00:33,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:00:33,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:00:33,263 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:00:33,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-12-07 11:00:33,310 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/data/1e43e3c7d/16ba6e95ab16412dafe035a2c93713d9/FLAG4d0a1bc09 [2019-12-07 11:00:33,718 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:00:33,719 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2019-12-07 11:00:33,722 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/data/1e43e3c7d/16ba6e95ab16412dafe035a2c93713d9/FLAG4d0a1bc09 [2019-12-07 11:00:33,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/data/1e43e3c7d/16ba6e95ab16412dafe035a2c93713d9 [2019-12-07 11:00:33,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:00:33,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:00:33,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:00:33,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:00:33,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:00:33,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9c5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33, skipping insertion in model container [2019-12-07 11:00:33,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:00:33,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:00:33,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:00:33,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:00:33,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:00:33,914 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:00:33,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33 WrapperNode [2019-12-07 11:00:33,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:00:33,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:00:33,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:00:33,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:00:33,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:00:33,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:00:33,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:00:33,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:00:33,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... [2019-12-07 11:00:33,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:00:33,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:00:33,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:00:33,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:00:33,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:00:33,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:00:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-12-07 11:00:33,992 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-12-07 11:00:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-12-07 11:00:33,993 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-12-07 11:00:34,103 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:00:34,103 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:00:34,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:00:34 BoogieIcfgContainer [2019-12-07 11:00:34,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:00:34,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:00:34,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:00:34,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:00:34,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:00:33" (1/3) ... [2019-12-07 11:00:34,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dfd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:00:34, skipping insertion in model container [2019-12-07 11:00:34,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:00:33" (2/3) ... [2019-12-07 11:00:34,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dfd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:00:34, skipping insertion in model container [2019-12-07 11:00:34,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:00:34" (3/3) ... [2019-12-07 11:00:34,110 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2019-12-07 11:00:34,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:00:34,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:00:34,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:00:34,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:00:34,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:00:34,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:00:34,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:00:34,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:00:34,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:00:34,152 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:00:34,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:00:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-12-07 11:00:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:00:34,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:34,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:34,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:34,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-12-07 11:00:34,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:34,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624939428] [2019-12-07 11:00:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:34,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624939428] [2019-12-07 11:00:34,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:34,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:00:34,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624408503] [2019-12-07 11:00:34,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:00:34,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:00:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:00:34,328 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-12-07 11:00:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:34,409 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-12-07 11:00:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:34,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 11:00:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:34,416 INFO L225 Difference]: With dead ends: 38 [2019-12-07 11:00:34,417 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:00:34,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:00:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:00:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 11:00:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:00:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 11:00:34,446 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-12-07 11:00:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:34,447 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 11:00:34,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:00:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 11:00:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:00:34,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:34,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:34,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-12-07 11:00:34,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:34,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845028672] [2019-12-07 11:00:34,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:34,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845028672] [2019-12-07 11:00:34,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:34,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:00:34,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631263070] [2019-12-07 11:00:34,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:00:34,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:00:34,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:00:34,494 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-12-07 11:00:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:34,549 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-12-07 11:00:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:34,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 11:00:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:34,550 INFO L225 Difference]: With dead ends: 32 [2019-12-07 11:00:34,550 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 11:00:34,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:00:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 11:00:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 11:00:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 11:00:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 11:00:34,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-12-07 11:00:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:34,559 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 11:00:34,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:00:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 11:00:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:00:34,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:34,560 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:34,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-12-07 11:00:34,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:34,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381160431] [2019-12-07 11:00:34,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:00:34,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381160431] [2019-12-07 11:00:34,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117828593] [2019-12-07 11:00:34,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:34,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:00:34,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:00:34,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:34,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-12-07 11:00:34,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290945063] [2019-12-07 11:00:34,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:00:34,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:00:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:00:34,733 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-12-07 11:00:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:34,830 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-12-07 11:00:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:00:34,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-12-07 11:00:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:34,832 INFO L225 Difference]: With dead ends: 59 [2019-12-07 11:00:34,832 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:00:34,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:00:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:00:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-12-07 11:00:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:00:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-12-07 11:00:34,838 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-12-07 11:00:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:34,839 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-12-07 11:00:34,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:00:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-12-07 11:00:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:00:34,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:34,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:35,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:35,041 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-12-07 11:00:35,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:35,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227865124] [2019-12-07 11:00:35,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:00:35,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227865124] [2019-12-07 11:00:35,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708105053] [2019-12-07 11:00:35,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:00:35,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:00:35,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:35,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-12-07 11:00:35,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915703692] [2019-12-07 11:00:35,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:00:35,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:00:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:00:35,172 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-12-07 11:00:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:35,292 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-12-07 11:00:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:00:35,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 11:00:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:35,295 INFO L225 Difference]: With dead ends: 55 [2019-12-07 11:00:35,295 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 11:00:35,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:00:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 11:00:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-12-07 11:00:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 11:00:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-12-07 11:00:35,303 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-12-07 11:00:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:35,304 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-12-07 11:00:35,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:00:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-12-07 11:00:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:00:35,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:35,305 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:35,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:35,506 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-12-07 11:00:35,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:35,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577708966] [2019-12-07 11:00:35,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:00:35,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577708966] [2019-12-07 11:00:35,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388531009] [2019-12-07 11:00:35,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:00:35,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:00:35,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:35,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-12-07 11:00:35,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442165773] [2019-12-07 11:00:35,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:00:35,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:00:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:00:35,691 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-12-07 11:00:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:35,931 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-12-07 11:00:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:00:35,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-12-07 11:00:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:35,934 INFO L225 Difference]: With dead ends: 114 [2019-12-07 11:00:35,934 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 11:00:35,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:00:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 11:00:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 11:00:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 11:00:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-12-07 11:00:35,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-12-07 11:00:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:35,949 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-12-07 11:00:35,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:00:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-12-07 11:00:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:00:35,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:35,951 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:36,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:36,152 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-12-07 11:00:36,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:36,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908980528] [2019-12-07 11:00:36,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 11:00:36,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908980528] [2019-12-07 11:00:36,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572785431] [2019-12-07 11:00:36,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:00:36,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 11:00:36,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:36,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-12-07 11:00:36,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115237467] [2019-12-07 11:00:36,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:00:36,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:36,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:00:36,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:00:36,332 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-12-07 11:00:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:36,481 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-12-07 11:00:36,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:00:36,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-12-07 11:00:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:36,484 INFO L225 Difference]: With dead ends: 147 [2019-12-07 11:00:36,484 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 11:00:36,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:00:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 11:00:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-12-07 11:00:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 11:00:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-12-07 11:00:36,495 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-12-07 11:00:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:36,496 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-12-07 11:00:36,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:00:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-12-07 11:00:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:00:36,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:36,498 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:36,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:36,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-12-07 11:00:36,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:36,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822201607] [2019-12-07 11:00:36,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:00:36,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822201607] [2019-12-07 11:00:36,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883387759] [2019-12-07 11:00:36,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:36,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:00:36,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 11:00:36,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:36,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-12-07 11:00:36,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949813050] [2019-12-07 11:00:36,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:00:36,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:00:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:00:36,995 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-12-07 11:00:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:37,288 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-12-07 11:00:37,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:00:37,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-12-07 11:00:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:37,291 INFO L225 Difference]: With dead ends: 164 [2019-12-07 11:00:37,291 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 11:00:37,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:00:37,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 11:00:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-12-07 11:00:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 11:00:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-12-07 11:00:37,307 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-12-07 11:00:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:37,308 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-12-07 11:00:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:00:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-12-07 11:00:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 11:00:37,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:37,312 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:37,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:37,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-12-07 11:00:37,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:37,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011729143] [2019-12-07 11:00:37,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 11:00:37,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011729143] [2019-12-07 11:00:37,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898345968] [2019-12-07 11:00:37,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:00:37,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:00:37,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:37,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-12-07 11:00:37,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113603162] [2019-12-07 11:00:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:00:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:00:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:00:37,838 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-12-07 11:00:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:38,181 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-12-07 11:00:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:00:38,182 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-12-07 11:00:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:38,183 INFO L225 Difference]: With dead ends: 207 [2019-12-07 11:00:38,183 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 11:00:38,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:00:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 11:00:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-12-07 11:00:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 11:00:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-12-07 11:00:38,195 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-12-07 11:00:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:38,195 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-12-07 11:00:38,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:00:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-12-07 11:00:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 11:00:38,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:38,197 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:38,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:38,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-12-07 11:00:38,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77327046] [2019-12-07 11:00:38,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 11:00:38,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77327046] [2019-12-07 11:00:38,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781138680] [2019-12-07 11:00:38,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:38,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:00:38,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-12-07 11:00:38,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:38,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2019-12-07 11:00:38,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061432003] [2019-12-07 11:00:38,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:00:38,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:00:38,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:00:38,842 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 23 states. [2019-12-07 11:00:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:39,333 INFO L93 Difference]: Finished difference Result 244 states and 473 transitions. [2019-12-07 11:00:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:00:39,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-12-07 11:00:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:39,335 INFO L225 Difference]: With dead ends: 244 [2019-12-07 11:00:39,335 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 11:00:39,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 11:00:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 11:00:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2019-12-07 11:00:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 11:00:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2019-12-07 11:00:39,349 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 119 [2019-12-07 11:00:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:39,349 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 224 transitions. [2019-12-07 11:00:39,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:00:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 224 transitions. [2019-12-07 11:00:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-07 11:00:39,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:39,353 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 13, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:39,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:39,554 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash 826902015, now seen corresponding path program 2 times [2019-12-07 11:00:39,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:39,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951797469] [2019-12-07 11:00:39,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 177 proven. 334 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-12-07 11:00:40,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951797469] [2019-12-07 11:00:40,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835580957] [2019-12-07 11:00:40,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:40,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:00:40,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:00:40,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:00:40,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 62 proven. 367 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-12-07 11:00:40,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:40,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 31 [2019-12-07 11:00:40,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877928947] [2019-12-07 11:00:40,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 11:00:40,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 11:00:40,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:00:40,185 INFO L87 Difference]: Start difference. First operand 134 states and 224 transitions. Second operand 31 states. [2019-12-07 11:00:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:41,044 INFO L93 Difference]: Finished difference Result 343 states and 691 transitions. [2019-12-07 11:00:41,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 11:00:41,044 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 201 [2019-12-07 11:00:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:41,047 INFO L225 Difference]: With dead ends: 343 [2019-12-07 11:00:41,047 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 11:00:41,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=424, Invalid=2882, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 11:00:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 11:00:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2019-12-07 11:00:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-12-07 11:00:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 315 transitions. [2019-12-07 11:00:41,064 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 315 transitions. Word has length 201 [2019-12-07 11:00:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:41,065 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 315 transitions. [2019-12-07 11:00:41,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 11:00:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 315 transitions. [2019-12-07 11:00:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-12-07 11:00:41,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:41,072 INFO L410 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 31, 22, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 12, 6, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:41,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:41,273 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1943816299, now seen corresponding path program 3 times [2019-12-07 11:00:41,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:41,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901009159] [2019-12-07 11:00:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1750 proven. 2033 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2019-12-07 11:00:42,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901009159] [2019-12-07 11:00:42,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986867132] [2019-12-07 11:00:42,501 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/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 [2019-12-07 11:00:42,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 11:00:42,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:00:42,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:00:42,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7468 backedges. 1287 proven. 0 refuted. 0 times theorem prover too weak. 6181 trivial. 0 not checked. [2019-12-07 11:00:42,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:00:42,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [28] total 31 [2019-12-07 11:00:42,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551854253] [2019-12-07 11:00:42,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:00:42,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:00:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:00:42,724 INFO L87 Difference]: Start difference. First operand 191 states and 315 transitions. Second operand 6 states. [2019-12-07 11:00:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:42,762 INFO L93 Difference]: Finished difference Result 347 states and 604 transitions. [2019-12-07 11:00:42,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:00:42,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 506 [2019-12-07 11:00:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:42,764 INFO L225 Difference]: With dead ends: 347 [2019-12-07 11:00:42,764 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:00:42,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:00:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:00:42,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2019-12-07 11:00:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 11:00:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2019-12-07 11:00:42,774 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 506 [2019-12-07 11:00:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:42,774 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2019-12-07 11:00:42,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:00:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2019-12-07 11:00:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-07 11:00:42,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:42,777 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 18, 16, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:42,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:42,979 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1893886498, now seen corresponding path program 4 times [2019-12-07 11:00:42,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:42,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880079146] [2019-12-07 11:00:42,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 191 proven. 567 refuted. 0 times theorem prover too weak. 1679 trivial. 0 not checked. [2019-12-07 11:00:43,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880079146] [2019-12-07 11:00:43,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060121325] [2019-12-07 11:00:43,469 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:43,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:00:43,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:00:43,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:00:43,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 114 proven. 657 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-12-07 11:00:43,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:43,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 27 [2019-12-07 11:00:43,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326829665] [2019-12-07 11:00:43,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:00:43,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:00:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:00:43,673 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand 27 states. [2019-12-07 11:00:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:44,399 INFO L93 Difference]: Finished difference Result 367 states and 650 transitions. [2019-12-07 11:00:44,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 11:00:44,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 295 [2019-12-07 11:00:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:44,402 INFO L225 Difference]: With dead ends: 367 [2019-12-07 11:00:44,402 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 11:00:44,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=389, Invalid=2263, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 11:00:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 11:00:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 182. [2019-12-07 11:00:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 11:00:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 287 transitions. [2019-12-07 11:00:44,416 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 287 transitions. Word has length 295 [2019-12-07 11:00:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:44,416 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 287 transitions. [2019-12-07 11:00:44,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:00:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 287 transitions. [2019-12-07 11:00:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-12-07 11:00:44,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:44,420 INFO L410 BasicCegarLoop]: trace histogram [43, 43, 38, 38, 32, 32, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 13, 11, 11, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:44,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:44,620 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash 665841761, now seen corresponding path program 5 times [2019-12-07 11:00:44,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:44,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024546175] [2019-12-07 11:00:44,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 1003 proven. 2174 refuted. 0 times theorem prover too weak. 5763 trivial. 0 not checked. [2019-12-07 11:00:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024546175] [2019-12-07 11:00:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305965707] [2019-12-07 11:00:45,795 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:45,867 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-12-07 11:00:45,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:00:45,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:00:45,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8940 backedges. 2805 proven. 34 refuted. 0 times theorem prover too weak. 6101 trivial. 0 not checked. [2019-12-07 11:00:46,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:46,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12] total 30 [2019-12-07 11:00:46,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004702895] [2019-12-07 11:00:46,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 11:00:46,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 11:00:46,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:00:46,132 INFO L87 Difference]: Start difference. First operand 182 states and 287 transitions. Second operand 30 states. [2019-12-07 11:00:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:46,496 INFO L93 Difference]: Finished difference Result 376 states and 640 transitions. [2019-12-07 11:00:46,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:00:46,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 553 [2019-12-07 11:00:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:46,498 INFO L225 Difference]: With dead ends: 376 [2019-12-07 11:00:46,498 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 11:00:46,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=1225, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:00:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 11:00:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2019-12-07 11:00:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-07 11:00:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 312 transitions. [2019-12-07 11:00:46,513 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 312 transitions. Word has length 553 [2019-12-07 11:00:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:46,514 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 312 transitions. [2019-12-07 11:00:46,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 11:00:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 312 transitions. [2019-12-07 11:00:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-12-07 11:00:46,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:46,522 INFO L410 BasicCegarLoop]: trace histogram [66, 66, 61, 61, 52, 51, 33, 33, 33, 33, 33, 33, 33, 30, 30, 30, 30, 30, 30, 30, 22, 18, 14, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:46,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:46,723 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1056772235, now seen corresponding path program 6 times [2019-12-07 11:00:46,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:46,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089969819] [2019-12-07 11:00:46,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22353 backedges. 4314 proven. 5300 refuted. 0 times theorem prover too weak. 12739 trivial. 0 not checked. [2019-12-07 11:00:49,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089969819] [2019-12-07 11:00:49,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716176847] [2019-12-07 11:00:49,384 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:49,477 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-12-07 11:00:49,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:00:49,479 INFO L264 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:00:49,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22353 backedges. 2273 proven. 86 refuted. 0 times theorem prover too weak. 19994 trivial. 0 not checked. [2019-12-07 11:00:49,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 13] total 46 [2019-12-07 11:00:49,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635883634] [2019-12-07 11:00:49,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 11:00:49,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 11:00:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 11:00:49,900 INFO L87 Difference]: Start difference. First operand 199 states and 312 transitions. Second operand 46 states. [2019-12-07 11:00:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:50,656 INFO L93 Difference]: Finished difference Result 423 states and 736 transitions. [2019-12-07 11:00:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:00:50,656 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 868 [2019-12-07 11:00:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:50,658 INFO L225 Difference]: With dead ends: 423 [2019-12-07 11:00:50,658 INFO L226 Difference]: Without dead ends: 237 [2019-12-07 11:00:50,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=3464, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 11:00:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-07 11:00:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2019-12-07 11:00:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-12-07 11:00:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2019-12-07 11:00:50,670 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 868 [2019-12-07 11:00:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:50,670 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2019-12-07 11:00:50,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 11:00:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2019-12-07 11:00:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-12-07 11:00:50,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:50,674 INFO L410 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 38, 37, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 15, 14, 11, 7, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:50,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:50,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1510191266, now seen corresponding path program 7 times [2019-12-07 11:00:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:50,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320282302] [2019-12-07 11:00:50,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 2047 proven. 2656 refuted. 0 times theorem prover too weak. 7166 trivial. 0 not checked. [2019-12-07 11:00:52,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320282302] [2019-12-07 11:00:52,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832789248] [2019-12-07 11:00:52,424 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:52,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:00:52,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 325 proven. 1776 refuted. 0 times theorem prover too weak. 9768 trivial. 0 not checked. [2019-12-07 11:00:52,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:52,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14] total 38 [2019-12-07 11:00:52,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50988934] [2019-12-07 11:00:52,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 11:00:52,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:52,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 11:00:52,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:00:52,827 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand 38 states. [2019-12-07 11:00:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:53,690 INFO L93 Difference]: Finished difference Result 466 states and 775 transitions. [2019-12-07 11:00:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 11:00:53,690 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 636 [2019-12-07 11:00:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:53,694 INFO L225 Difference]: With dead ends: 466 [2019-12-07 11:00:53,694 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 11:00:53,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=3303, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 11:00:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 11:00:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 233. [2019-12-07 11:00:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 11:00:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 350 transitions. [2019-12-07 11:00:53,707 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 350 transitions. Word has length 636 [2019-12-07 11:00:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:53,708 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 350 transitions. [2019-12-07 11:00:53,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 11:00:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 350 transitions. [2019-12-07 11:00:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1685 [2019-12-07 11:00:53,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:53,722 INFO L410 BasicCegarLoop]: trace histogram [125, 125, 122, 122, 101, 98, 62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 40, 36, 24, 24, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:53,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:53,923 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:53,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1612905355, now seen corresponding path program 8 times [2019-12-07 11:00:53,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:53,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305765477] [2019-12-07 11:00:53,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 85211 backedges. 15552 proven. 14733 refuted. 0 times theorem prover too weak. 54926 trivial. 0 not checked. [2019-12-07 11:01:01,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305765477] [2019-12-07 11:01:01,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7856960] [2019-12-07 11:01:01,510 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:01,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:01:01,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:01:01,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 3742 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:01:01,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:01:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 85211 backedges. 918 proven. 4385 refuted. 0 times theorem prover too weak. 79908 trivial. 0 not checked. [2019-12-07 11:01:03,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:01:03,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 13] total 53 [2019-12-07 11:01:03,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421839957] [2019-12-07 11:01:03,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 11:01:03,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 11:01:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2463, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 11:01:03,071 INFO L87 Difference]: Start difference. First operand 233 states and 350 transitions. Second operand 53 states. [2019-12-07 11:01:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:04,778 INFO L93 Difference]: Finished difference Result 542 states and 878 transitions. [2019-12-07 11:01:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-07 11:01:04,778 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1684 [2019-12-07 11:01:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:04,781 INFO L225 Difference]: With dead ends: 542 [2019-12-07 11:01:04,781 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 11:01:04,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2339 GetRequests, 2245 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=956, Invalid=8164, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 11:01:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 11:01:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 279. [2019-12-07 11:01:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-07 11:01:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 434 transitions. [2019-12-07 11:01:04,802 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 434 transitions. Word has length 1684 [2019-12-07 11:01:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,803 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 434 transitions. [2019-12-07 11:01:04,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 11:01:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 434 transitions. [2019-12-07 11:01:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-12-07 11:01:04,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,815 INFO L410 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 70, 70, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 27, 27, 17, 16, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:05,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:05,016 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1116406177, now seen corresponding path program 9 times [2019-12-07 11:01:05,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:05,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738608847] [2019-12-07 11:01:05,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 41638 backedges. 4952 proven. 6432 refuted. 0 times theorem prover too weak. 30254 trivial. 0 not checked. [2019-12-07 11:01:09,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738608847] [2019-12-07 11:01:09,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407296104] [2019-12-07 11:01:09,066 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:09,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-12-07 11:01:09,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:01:09,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 1418 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 11:01:09,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:01:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 41638 backedges. 15625 proven. 300 refuted. 0 times theorem prover too weak. 25713 trivial. 0 not checked. [2019-12-07 11:01:10,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:01:10,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 58 [2019-12-07 11:01:10,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436472212] [2019-12-07 11:01:10,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-07 11:01:10,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-07 11:01:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2908, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 11:01:10,049 INFO L87 Difference]: Start difference. First operand 279 states and 434 transitions. Second operand 58 states. [2019-12-07 11:01:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:11,521 INFO L93 Difference]: Finished difference Result 652 states and 1198 transitions. [2019-12-07 11:01:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-07 11:01:11,522 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1181 [2019-12-07 11:01:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:11,525 INFO L225 Difference]: With dead ends: 652 [2019-12-07 11:01:11,525 INFO L226 Difference]: Without dead ends: 394 [2019-12-07 11:01:11,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1529 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=723, Invalid=5597, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 11:01:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-07 11:01:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 291. [2019-12-07 11:01:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 11:01:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 469 transitions. [2019-12-07 11:01:11,543 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 469 transitions. Word has length 1181 [2019-12-07 11:01:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:11,544 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 469 transitions. [2019-12-07 11:01:11,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-07 11:01:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 469 transitions. [2019-12-07 11:01:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-12-07 11:01:11,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:11,551 INFO L410 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:11,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:11,752 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2120753046, now seen corresponding path program 10 times [2019-12-07 11:01:11,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:11,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109661330] [2019-12-07 11:01:11,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2642 proven. 3388 refuted. 0 times theorem prover too weak. 25606 trivial. 0 not checked. [2019-12-07 11:01:14,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109661330] [2019-12-07 11:01:14,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350887596] [2019-12-07 11:01:14,663 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:14,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:01:14,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:01:14,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:01:14,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:01:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2426 proven. 749 refuted. 0 times theorem prover too weak. 28461 trivial. 0 not checked. [2019-12-07 11:01:15,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:01:15,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 41 [2019-12-07 11:01:15,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173827997] [2019-12-07 11:01:15,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 11:01:15,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 11:01:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:01:15,271 INFO L87 Difference]: Start difference. First operand 291 states and 469 transitions. Second operand 41 states. [2019-12-07 11:01:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:16,159 INFO L93 Difference]: Finished difference Result 565 states and 967 transitions. [2019-12-07 11:01:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 11:01:16,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1031 [2019-12-07 11:01:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:16,162 INFO L225 Difference]: With dead ends: 565 [2019-12-07 11:01:16,162 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:01:16,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1392 GetRequests, 1329 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=489, Invalid=3671, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 11:01:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:01:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2019-12-07 11:01:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 11:01:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 445 transitions. [2019-12-07 11:01:16,178 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 445 transitions. Word has length 1031 [2019-12-07 11:01:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:16,179 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 445 transitions. [2019-12-07 11:01:16,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 11:01:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 445 transitions. [2019-12-07 11:01:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-12-07 11:01:16,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:16,189 INFO L410 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:16,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:16,389 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1008927292, now seen corresponding path program 11 times [2019-12-07 11:01:16,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:16,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314151051] [2019-12-07 11:01:16,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:16,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:01:16,698 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:01:16,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:01:16 BoogieIcfgContainer [2019-12-07 11:01:16,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:01:16,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:01:16,801 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:01:16,801 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:01:16,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:00:34" (3/4) ... [2019-12-07 11:01:16,802 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:01:16,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2da1ceca-6f1c-462e-a16f-88167cf95983/bin/uautomizer/witness.graphml [2019-12-07 11:01:16,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:01:16,919 INFO L168 Benchmark]: Toolchain (without parser) took 43185.66 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 949.0 MB in the beginning and 1.2 GB in the end (delta: -264.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,920 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:16,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:16,920 INFO L168 Benchmark]: Boogie Preprocessor took 11.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,920 INFO L168 Benchmark]: RCFGBuilder took 156.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,921 INFO L168 Benchmark]: TraceAbstraction took 42695.83 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,921 INFO L168 Benchmark]: Witness Printer took 117.50 ms. Allocated memory is still 3.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:16,922 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42695.83 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 117.50 ms. Allocated memory is still 3.6 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; [L37] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 55 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 42.5s, OverallIterations: 19, TraceHistogramMax: 125, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 624 SDtfs, 1874 SDslu, 7281 SDs, 0 SdLazy, 15800 SolverSat, 2681 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10309 GetRequests, 9619 SyntacticMatches, 0 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=17, 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, 18 MinimizatonAttempts, 376 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 15889 NumberOfCodeBlocks, 13872 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 14647 ConstructedInterpolants, 0 QuantifiedInterpolants, 19911860 SizeOfPredicates, 102 NumberOfNonLiveVariables, 11690 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 34 InterpolantComputations, 3 PerfectInterpolantSequences, 380128/426594 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...