./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.24-cad4683 [2019-10-22 08:58:01,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:01,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:01,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:01,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:01,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:01,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:01,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:01,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:01,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:01,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:01,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:01,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:01,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:01,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:01,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:01,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:01,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:01,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:01,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:01,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:01,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:01,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:01,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:01,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:01,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:01,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:01,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:01,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:01,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:01,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:01,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:01,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:01,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:01,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:01,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:01,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:01,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:01,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:01,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:01,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:01,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:01,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:01,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:01,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:01,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:01,839 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:01,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:01,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:01,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:01,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:01,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:01,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:01,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:01,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:01,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:01,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:01,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:01,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:01,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:01,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:01,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:01,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:01,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:01,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:01,844 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/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-10-22 08:58:01,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:01,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:01,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:01,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:01,884 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:01,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-10-22 08:58:01,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/data/6694382f4/1d824b5d39074fceb513b4e526ebc933/FLAG921a9513f [2019-10-22 08:58:02,273 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:02,274 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-10-22 08:58:02,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/data/6694382f4/1d824b5d39074fceb513b4e526ebc933/FLAG921a9513f [2019-10-22 08:58:02,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/data/6694382f4/1d824b5d39074fceb513b4e526ebc933 [2019-10-22 08:58:02,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:02,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:02,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:02,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:02,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:02,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:02" (1/1) ... [2019-10-22 08:58:02,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b3b44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:02, skipping insertion in model container [2019-10-22 08:58:02,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:02" (1/1) ... [2019-10-22 08:58:02,769 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:02,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:02,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:02,923 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:03,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:03,013 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:03,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03 WrapperNode [2019-10-22 08:58:03,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:03,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:03,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:03,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:03,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:03,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:03,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:03,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:03,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... [2019-10-22 08:58:03,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:03,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:03,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:03,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:03,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:03,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-10-22 08:58:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-10-22 08:58:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-10-22 08:58:03,107 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-10-22 08:58:03,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:03,240 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-22 08:58:03,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03 BoogieIcfgContainer [2019-10-22 08:58:03,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:03,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:03,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:03,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:03,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:02" (1/3) ... [2019-10-22 08:58:03,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246e4bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:03, skipping insertion in model container [2019-10-22 08:58:03,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:03" (2/3) ... [2019-10-22 08:58:03,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246e4bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:03, skipping insertion in model container [2019-10-22 08:58:03,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03" (3/3) ... [2019-10-22 08:58:03,248 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-10-22 08:58:03,258 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:03,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:03,282 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:03,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:03,309 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:03,309 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:03,309 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:03,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:03,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:03,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:03,310 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-22 08:58:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 08:58:03,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,336 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-10-22 08:58:03,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410182991] [2019-10-22 08:58:03,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410182991] [2019-10-22 08:58:03,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:03,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994300636] [2019-10-22 08:58:03,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:03,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:03,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:03,568 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-10-22 08:58:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,671 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-10-22 08:58:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:03,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-10-22 08:58:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:03,683 INFO L225 Difference]: With dead ends: 38 [2019-10-22 08:58:03,684 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 08:58:03,687 INFO L600 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-10-22 08:58:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 08:58:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 08:58:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:58:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-22 08:58:03,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-10-22 08:58:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:03,727 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 08:58:03,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-10-22 08:58:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:58:03,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,729 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-10-22 08:58:03,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813458675] [2019-10-22 08:58:03,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813458675] [2019-10-22 08:58:03,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:03,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193202081] [2019-10-22 08:58:03,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:03,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:03,790 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-10-22 08:58:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,859 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-10-22 08:58:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:03,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-10-22 08:58:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:03,861 INFO L225 Difference]: With dead ends: 32 [2019-10-22 08:58:03,861 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 08:58:03,862 INFO L600 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-10-22 08:58:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 08:58:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-10-22 08:58:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:58:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-22 08:58:03,868 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-10-22 08:58:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:03,869 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 08:58:03,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-10-22 08:58:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:03,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,870 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-10-22 08:58:03,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108239725] [2019-10-22 08:58:03,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:03,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108239725] [2019-10-22 08:58:03,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164156568] [2019-10-22 08:58:03,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:04,100 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:04,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-22 08:58:04,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568650276] [2019-10-22 08:58:04,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:58:04,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:58:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:58:04,104 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-10-22 08:58:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:04,279 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-10-22 08:58:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:04,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-22 08:58:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:04,280 INFO L225 Difference]: With dead ends: 59 [2019-10-22 08:58:04,280 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 08:58:04,281 INFO L600 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-10-22 08:58:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 08:58:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-10-22 08:58:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:58:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-10-22 08:58:04,289 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-10-22 08:58:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:04,289 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-10-22 08:58:04,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:58:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-10-22 08:58:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:04,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:04,291 INFO L380 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-10-22 08:58:04,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:04,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-10-22 08:58:04,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699225088] [2019-10-22 08:58:04,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:04,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699225088] [2019-10-22 08:58:04,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060069075] [2019-10-22 08:58:04,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:04,673 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:04,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-22 08:58:04,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447021126] [2019-10-22 08:58:04,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:58:04,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:58:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:58:04,675 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-10-22 08:58:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:04,860 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-10-22 08:58:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:04,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-10-22 08:58:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:04,863 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:58:04,863 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 08:58:04,864 INFO L600 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-10-22 08:58:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 08:58:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-10-22 08:58:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:58:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-10-22 08:58:04,876 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-10-22 08:58:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:04,877 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-10-22 08:58:04,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:58:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-10-22 08:58:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:58:04,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:04,879 INFO L380 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-10-22 08:58:05,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:05,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,080 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-10-22 08:58:05,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19932951] [2019-10-22 08:58:05,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:58:05,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19932951] [2019-10-22 08:58:05,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288731561] [2019-10-22 08:58:05,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:05,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-22 08:58:05,336 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:05,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-10-22 08:58:05,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515593672] [2019-10-22 08:58:05,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:58:05,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:05,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:58:05,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:58:05,338 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-10-22 08:58:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,749 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-10-22 08:58:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:58:05,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-10-22 08:58:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:05,752 INFO L225 Difference]: With dead ends: 114 [2019-10-22 08:58:05,752 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 08:58:05,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:58:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 08:58:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-22 08:58:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:58:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-10-22 08:58:05,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-10-22 08:58:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:05,776 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-10-22 08:58:05,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:58:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-10-22 08:58:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:58:05,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:05,781 INFO L380 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-10-22 08:58:05,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:05,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-10-22 08:58:05,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146128882] [2019-10-22 08:58:05,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 08:58:06,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146128882] [2019-10-22 08:58:06,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422445461] [2019-10-22 08:58:06,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:58:06,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:06,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-22 08:58:06,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918327968] [2019-10-22 08:58:06,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:58:06,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:58:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:58:06,228 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-10-22 08:58:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:06,471 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-10-22 08:58:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:58:06,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-10-22 08:58:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:06,473 INFO L225 Difference]: With dead ends: 147 [2019-10-22 08:58:06,473 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:58:06,475 INFO L600 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-10-22 08:58:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:58:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-10-22 08:58:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:58:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-10-22 08:58:06,486 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-10-22 08:58:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:06,487 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-10-22 08:58:06,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:58:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-10-22 08:58:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:58:06,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:06,489 INFO L380 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-10-22 08:58:06,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:06,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-10-22 08:58:06,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179588172] [2019-10-22 08:58:06,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-22 08:58:06,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179588172] [2019-10-22 08:58:06,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824731975] [2019-10-22 08:58:06,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 08:58:06,977 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:06,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-10-22 08:58:06,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109826234] [2019-10-22 08:58:06,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 08:58:06,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 08:58:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:58:06,980 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-10-22 08:58:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:07,395 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-10-22 08:58:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 08:58:07,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-10-22 08:58:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:07,397 INFO L225 Difference]: With dead ends: 164 [2019-10-22 08:58:07,398 INFO L226 Difference]: Without dead ends: 100 [2019-10-22 08:58:07,399 INFO L600 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-10-22 08:58:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-22 08:58:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-10-22 08:58:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:58:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-10-22 08:58:07,427 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-10-22 08:58:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:07,427 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-10-22 08:58:07,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 08:58:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-10-22 08:58:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 08:58:07,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:07,429 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:07,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:07,630 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1894743046, now seen corresponding path program 2 times [2019-10-22 08:58:07,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892678161] [2019-10-22 08:58:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-22 08:58:07,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892678161] [2019-10-22 08:58:07,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102779261] [2019-10-22 08:58:07,966 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:08,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:08,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:08,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:58:08,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 13 proven. 88 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-22 08:58:08,104 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:08,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-10-22 08:58:08,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159085600] [2019-10-22 08:58:08,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 08:58:08,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 08:58:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:58:08,105 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 21 states. [2019-10-22 08:58:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:08,656 INFO L93 Difference]: Finished difference Result 212 states and 399 transitions. [2019-10-22 08:58:08,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-22 08:58:08,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-10-22 08:58:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:08,657 INFO L225 Difference]: With dead ends: 212 [2019-10-22 08:58:08,658 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 08:58:08,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2019-10-22 08:58:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 08:58:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2019-10-22 08:58:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-22 08:58:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2019-10-22 08:58:08,671 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2019-10-22 08:58:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:08,672 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2019-10-22 08:58:08,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 08:58:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2019-10-22 08:58:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 08:58:08,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:08,675 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:08,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:08,876 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash 973264012, now seen corresponding path program 1 times [2019-10-22 08:58:08,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:08,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366960387] [2019-10-22 08:58:08,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:08,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 55 proven. 127 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-22 08:58:09,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366960387] [2019-10-22 08:58:09,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635052675] [2019-10-22 08:58:09,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:58:09,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 24 proven. 158 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-22 08:58:09,393 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:09,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2019-10-22 08:58:09,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899128704] [2019-10-22 08:58:09,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-22 08:58:09,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-22 08:58:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-10-22 08:58:09,395 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand 23 states. [2019-10-22 08:58:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:10,017 INFO L93 Difference]: Finished difference Result 227 states and 397 transitions. [2019-10-22 08:58:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 08:58:10,018 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 120 [2019-10-22 08:58:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:10,020 INFO L225 Difference]: With dead ends: 227 [2019-10-22 08:58:10,020 INFO L226 Difference]: Without dead ends: 139 [2019-10-22 08:58:10,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-10-22 08:58:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-22 08:58:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2019-10-22 08:58:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-22 08:58:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 197 transitions. [2019-10-22 08:58:10,044 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 197 transitions. Word has length 120 [2019-10-22 08:58:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:10,044 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 197 transitions. [2019-10-22 08:58:10,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-22 08:58:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 197 transitions. [2019-10-22 08:58:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-22 08:58:10,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:10,051 INFO L380 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-10-22 08:58:10,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:10,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 826902015, now seen corresponding path program 1 times [2019-10-22 08:58:10,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942422507] [2019-10-22 08:58:10,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 177 proven. 334 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-10-22 08:58:10,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942422507] [2019-10-22 08:58:10,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941425104] [2019-10-22 08:58:10,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 62 proven. 367 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-22 08:58:11,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:11,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 31 [2019-10-22 08:58:11,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262605323] [2019-10-22 08:58:11,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-22 08:58:11,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-22 08:58:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-10-22 08:58:11,031 INFO L87 Difference]: Start difference. First operand 123 states and 197 transitions. Second operand 31 states. [2019-10-22 08:58:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,213 INFO L93 Difference]: Finished difference Result 325 states and 632 transitions. [2019-10-22 08:58:12,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-22 08:58:12,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 201 [2019-10-22 08:58:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,216 INFO L225 Difference]: With dead ends: 325 [2019-10-22 08:58:12,217 INFO L226 Difference]: Without dead ends: 198 [2019-10-22 08:58:12,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=424, Invalid=2882, Unknown=0, NotChecked=0, Total=3306 [2019-10-22 08:58:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-22 08:58:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2019-10-22 08:58:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 08:58:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 283 transitions. [2019-10-22 08:58:12,237 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 283 transitions. Word has length 201 [2019-10-22 08:58:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 283 transitions. [2019-10-22 08:58:12,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-22 08:58:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 283 transitions. [2019-10-22 08:58:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-22 08:58:12,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,243 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 20, 18, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 8, 7, 6, 5, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:12,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,444 INFO L82 PathProgramCache]: Analyzing trace with hash 911205598, now seen corresponding path program 2 times [2019-10-22 08:58:12,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680142717] [2019-10-22 08:58:12,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3419 backedges. 857 proven. 859 refuted. 0 times theorem prover too weak. 1703 trivial. 0 not checked. [2019-10-22 08:58:13,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680142717] [2019-10-22 08:58:13,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948418579] [2019-10-22 08:58:13,552 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:13,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:13,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:13,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:58:13,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3419 backedges. 185 proven. 540 refuted. 0 times theorem prover too weak. 2694 trivial. 0 not checked. [2019-10-22 08:58:13,853 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:13,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 38 [2019-10-22 08:58:13,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013821082] [2019-10-22 08:58:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-22 08:58:13,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-22 08:58:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2019-10-22 08:58:13,855 INFO L87 Difference]: Start difference. First operand 180 states and 283 transitions. Second operand 38 states. [2019-10-22 08:58:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,911 INFO L93 Difference]: Finished difference Result 374 states and 658 transitions. [2019-10-22 08:58:14,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-22 08:58:14,911 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 347 [2019-10-22 08:58:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,914 INFO L225 Difference]: With dead ends: 374 [2019-10-22 08:58:14,914 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 08:58:14,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=438, Invalid=3222, Unknown=0, NotChecked=0, Total=3660 [2019-10-22 08:58:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 08:58:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2019-10-22 08:58:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-22 08:58:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-10-22 08:58:14,947 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 347 [2019-10-22 08:58:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,947 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 247 transitions. [2019-10-22 08:58:14,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-22 08:58:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 247 transitions. [2019-10-22 08:58:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-10-22 08:58:14,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,959 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 31, 30, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 12, 12, 8, 6, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:15,160 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,160 INFO L82 PathProgramCache]: Analyzing trace with hash 167863297, now seen corresponding path program 3 times [2019-10-22 08:58:15,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149332060] [2019-10-22 08:58:15,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7672 backedges. 1176 proven. 1666 refuted. 0 times theorem prover too weak. 4830 trivial. 0 not checked. [2019-10-22 08:58:16,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149332060] [2019-10-22 08:58:16,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606091554] [2019-10-22 08:58:16,609 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:16,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-22 08:58:16,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:16,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 08:58:16,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7672 backedges. 1103 proven. 164 refuted. 0 times theorem prover too weak. 6405 trivial. 0 not checked. [2019-10-22 08:58:16,993 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:16,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 34 [2019-10-22 08:58:16,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400558823] [2019-10-22 08:58:16,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-22 08:58:16,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-22 08:58:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 08:58:16,995 INFO L87 Difference]: Start difference. First operand 166 states and 247 transitions. Second operand 34 states. [2019-10-22 08:58:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,976 INFO L93 Difference]: Finished difference Result 364 states and 571 transitions. [2019-10-22 08:58:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-22 08:58:17,977 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 514 [2019-10-22 08:58:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,979 INFO L225 Difference]: With dead ends: 364 [2019-10-22 08:58:17,980 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 08:58:17,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 672 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2019-10-22 08:58:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 08:58:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2019-10-22 08:58:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-22 08:58:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2019-10-22 08:58:17,997 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 514 [2019-10-22 08:58:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:17,998 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2019-10-22 08:58:17,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-22 08:58:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2019-10-22 08:58:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-10-22 08:58:18,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,024 INFO L380 BasicCegarLoop]: trace histogram [61, 61, 58, 58, 49, 47, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 19, 18, 14, 9, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:18,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash -687587818, now seen corresponding path program 4 times [2019-10-22 08:58:18,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73506778] [2019-10-22 08:58:18,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19553 backedges. 4043 proven. 4287 refuted. 0 times theorem prover too weak. 11223 trivial. 0 not checked. [2019-10-22 08:58:21,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73506778] [2019-10-22 08:58:21,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396122789] [2019-10-22 08:58:21,654 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/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-10-22 08:58:21,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:58:21,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:21,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:58:21,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19553 backedges. 675 proven. 1589 refuted. 0 times theorem prover too weak. 17289 trivial. 0 not checked. [2019-10-22 08:58:22,192 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:22,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 13] total 54 [2019-10-22 08:58:22,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066222551] [2019-10-22 08:58:22,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-22 08:58:22,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-22 08:58:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2567, Unknown=0, NotChecked=0, Total=2862 [2019-10-22 08:58:22,195 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 54 states. [2019-10-22 08:58:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,192 INFO L93 Difference]: Finished difference Result 465 states and 826 transitions. [2019-10-22 08:58:24,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-22 08:58:24,193 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 813 [2019-10-22 08:58:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,195 INFO L225 Difference]: With dead ends: 465 [2019-10-22 08:58:24,195 INFO L226 Difference]: Without dead ends: 242 [2019-10-22 08:58:24,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1071 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=830, Invalid=7180, Unknown=0, NotChecked=0, Total=8010 [2019-10-22 08:58:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-22 08:58:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 186. [2019-10-22 08:58:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 08:58:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 248 transitions. [2019-10-22 08:58:24,213 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 248 transitions. Word has length 813 [2019-10-22 08:58:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,214 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 248 transitions. [2019-10-22 08:58:24,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-22 08:58:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 248 transitions. [2019-10-22 08:58:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-10-22 08:58:24,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,217 INFO L380 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:24,418 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 706303904, now seen corresponding path program 5 times [2019-10-22 08:58:24,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592841558] [2019-10-22 08:58:24,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:24,578 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:24,578 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:58:24,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:24 BoogieIcfgContainer [2019-10-22 08:58:24,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:24,646 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:24,646 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:24,646 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:24,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:03" (3/4) ... [2019-10-22 08:58:24,649 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:58:24,773 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f0966ff0-cf60-49f2-9fef-d7631cd4d615/bin/uautomizer/witness.graphml [2019-10-22 08:58:24,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:24,777 INFO L168 Benchmark]: Toolchain (without parser) took 22020.20 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 999.8 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 861.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,778 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:24,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.22 ms. Allocated memory is still 1.2 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-10-22 08:58:24,779 INFO L168 Benchmark]: Boogie Preprocessor took 13.32 ms. Allocated memory is still 1.2 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-10-22 08:58:24,779 INFO L168 Benchmark]: RCFGBuilder took 183.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,780 INFO L168 Benchmark]: TraceAbstraction took 21403.92 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 864.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 886.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,780 INFO L168 Benchmark]: Witness Printer took 127.21 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:24,781 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.22 ms. Allocated memory is still 1.2 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. * Boogie Preprocessor took 13.32 ms. Allocated memory is still 1.2 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 183.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21403.92 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 864.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.3 MB). Peak memory consumption was 886.3 MB. Max. memory is 11.5 GB. * Witness Printer took 127.21 ms. Allocated memory is still 2.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 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 = 8; [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 21 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 21.3s, OverallIterations: 14, TraceHistogramMax: 61, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 406 SDtfs, 1221 SDslu, 4491 SDs, 0 SdLazy, 9148 SolverSat, 1628 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3344 GetRequests, 2929 SyntacticMatches, 1 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5666 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=13, 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, 13 MinimizatonAttempts, 207 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 4980 NumberOfCodeBlocks, 4616 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4497 ConstructedInterpolants, 0 QuantifiedInterpolants, 3379267 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4127 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 54476/64786 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...