./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 11:10:22,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:10:22,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:10:22,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:10:22,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:10:22,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:10:22,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:10:22,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:10:22,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:10:22,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:10:22,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:10:22,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:10:22,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:10:22,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:10:22,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:10:22,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:10:22,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:10:22,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:10:22,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:10:22,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:10:22,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:10:22,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:10:22,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:10:22,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:10:22,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:10:22,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:10:22,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:10:22,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:10:22,999 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:10:23,000 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:10:23,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:10:23,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:10:23,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:10:23,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:10:23,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:10:23,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:10:23,001 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 11:10:23,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:10:23,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:10:23,009 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:10:23,009 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:10:23,009 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:10:23,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:10:23,009 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:10:23,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:10:23,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:10:23,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:10:23,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:10:23,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-12-09 11:10:23,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:10:23,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:10:23,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:10:23,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:10:23,041 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:10:23,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-09 11:10:23,083 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/data/e50ccb546/446b5da714cd450f989692f57f073430/FLAGc583bba32 [2018-12-09 11:10:23,460 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:10:23,461 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-09 11:10:23,464 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/data/e50ccb546/446b5da714cd450f989692f57f073430/FLAGc583bba32 [2018-12-09 11:10:23,472 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/data/e50ccb546/446b5da714cd450f989692f57f073430 [2018-12-09 11:10:23,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:10:23,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:10:23,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:10:23,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:10:23,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:10:23,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3163dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23, skipping insertion in model container [2018-12-09 11:10:23,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:10:23,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:10:23,575 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:10:23,577 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:10:23,586 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:10:23,594 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:10:23,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23 WrapperNode [2018-12-09 11:10:23,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:10:23,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:10:23,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:10:23,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:10:23,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:10:23,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:10:23,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:10:23,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:10:23,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... [2018-12-09 11:10:23,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:10:23,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:10:23,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:10:23,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:10:23,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/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 [2018-12-09 11:10:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:10:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:10:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:10:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:10:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:10:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:10:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 11:10:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 11:10:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 11:10:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 11:10:23,775 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:10:23,775 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 11:10:23,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:23 BoogieIcfgContainer [2018-12-09 11:10:23,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:10:23,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:10:23,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:10:23,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:10:23,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:10:23" (1/3) ... [2018-12-09 11:10:23,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:10:23, skipping insertion in model container [2018-12-09 11:10:23,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:10:23" (2/3) ... [2018-12-09 11:10:23,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb89205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:10:23, skipping insertion in model container [2018-12-09 11:10:23,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:23" (3/3) ... [2018-12-09 11:10:23,780 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-12-09 11:10:23,786 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:10:23,790 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 11:10:23,799 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 11:10:23,816 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:10:23,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:10:23,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:10:23,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:10:23,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:10:23,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:10:23,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:10:23,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:10:23,817 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:10:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 11:10:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 11:10:23,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:23,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:23,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:23,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 11:10:23,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:23,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:10:23,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:10:23,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:10:23,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:10:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:10:23,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:10:23,941 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 11:10:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:23,991 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 11:10:23,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:10:23,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 11:10:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:23,998 INFO L225 Difference]: With dead ends: 44 [2018-12-09 11:10:23,998 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 11:10:24,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:10:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 11:10:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 11:10:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 11:10:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 11:10:24,024 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 11:10:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,025 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 11:10:24,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:10:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 11:10:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 11:10:24,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:24,026 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 11:10:24,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:10:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:10:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:10:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:10:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:10:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:10:24,054 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 11:10:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:24,091 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 11:10:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:10:24,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 11:10:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:24,093 INFO L225 Difference]: With dead ends: 36 [2018-12-09 11:10:24,093 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 11:10:24,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:10:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 11:10:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 11:10:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 11:10:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 11:10:24,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 11:10:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,100 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 11:10:24,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:10:24,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 11:10:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:10:24,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,102 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:24,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 11:10:24,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:10:24,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:24,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:10:24,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:24,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-09 11:10:24,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:10:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:10:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:10:24,228 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-12-09 11:10:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:24,326 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-12-09 11:10:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:10:24,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-09 11:10:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:24,327 INFO L225 Difference]: With dead ends: 58 [2018-12-09 11:10:24,327 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 11:10:24,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:10:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 11:10:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-09 11:10:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 11:10:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-09 11:10:24,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-12-09 11:10:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,332 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-09 11:10:24,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:10:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-09 11:10:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 11:10:24,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,333 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:24,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-12-09 11:10:24,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:10:24,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:24,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:24,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:10:24,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:24,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 11:10:24,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:10:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:10:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:10:24,404 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-12-09 11:10:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:24,464 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-12-09 11:10:24,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:10:24,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 11:10:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:24,466 INFO L225 Difference]: With dead ends: 43 [2018-12-09 11:10:24,466 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 11:10:24,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:10:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 11:10:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-09 11:10:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 11:10:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-09 11:10:24,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-12-09 11:10:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,472 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-09 11:10:24,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:10:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-12-09 11:10:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 11:10:24,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,473 INFO L402 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, 1, 1, 1] [2018-12-09 11:10:24,473 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 11:10:24,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:10:24,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:24,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:24,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 11:10:24,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:24,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-09 11:10:24,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:10:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:10:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:10:24,610 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-12-09 11:10:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:24,736 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-12-09 11:10:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:10:24,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-09 11:10:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:24,737 INFO L225 Difference]: With dead ends: 70 [2018-12-09 11:10:24,737 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 11:10:24,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:10:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 11:10:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 11:10:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 11:10:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-09 11:10:24,743 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-12-09 11:10:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,743 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-09 11:10:24,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:10:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-09 11:10:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 11:10:24,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,744 INFO L402 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, 1, 1, 1, 1] [2018-12-09 11:10:24,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-12-09 11:10:24,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 11:10:24,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:24,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:24,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:10:24,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:24,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-09 11:10:24,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:10:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:10:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:10:24,838 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-12-09 11:10:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:24,941 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-12-09 11:10:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:10:24,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-12-09 11:10:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:24,942 INFO L225 Difference]: With dead ends: 61 [2018-12-09 11:10:24,943 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 11:10:24,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:10:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 11:10:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-12-09 11:10:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 11:10:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-09 11:10:24,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-12-09 11:10:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:24,952 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-09 11:10:24,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:10:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-09 11:10:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 11:10:24,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:24,954 INFO L402 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, 1, 1, 1, 1] [2018-12-09 11:10:24,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:24,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-12-09 11:10:24,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:24,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:24,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 11:10:25,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:25,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:25,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 11:10:25,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:25,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-09 11:10:25,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:10:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:10:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:10:25,066 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-12-09 11:10:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:25,168 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-12-09 11:10:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:10:25,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-09 11:10:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:25,169 INFO L225 Difference]: With dead ends: 71 [2018-12-09 11:10:25,169 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 11:10:25,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:10:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 11:10:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-09 11:10:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 11:10:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-09 11:10:25,178 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-12-09 11:10:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:25,179 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-09 11:10:25,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:10:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-09 11:10:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 11:10:25,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:25,180 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:25,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:25,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-12-09 11:10:25,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:25,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:25,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:25,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:25,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 11:10:25,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:25,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:25,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 11:10:25,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 11:10:25,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:10:25,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 11:10:25,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-09 11:10:25,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 11:10:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 11:10:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:10:25,347 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-12-09 11:10:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:25,668 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-12-09 11:10:25,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 11:10:25,669 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-12-09 11:10:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:25,670 INFO L225 Difference]: With dead ends: 146 [2018-12-09 11:10:25,670 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 11:10:25,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-09 11:10:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 11:10:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-12-09 11:10:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 11:10:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-12-09 11:10:25,681 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-12-09 11:10:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:25,681 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-12-09 11:10:25,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 11:10:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-12-09 11:10:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 11:10:25,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:25,683 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:25,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:25,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2059253460, now seen corresponding path program 1 times [2018-12-09 11:10:25,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:25,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:10:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 66 proven. 113 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-09 11:10:25,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:25,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:25,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:25,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-09 11:10:25,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:25,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-09 11:10:25,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 11:10:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 11:10:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-09 11:10:25,879 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-12-09 11:10:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:26,275 INFO L93 Difference]: Finished difference Result 239 states and 535 transitions. [2018-12-09 11:10:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 11:10:26,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2018-12-09 11:10:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:26,277 INFO L225 Difference]: With dead ends: 239 [2018-12-09 11:10:26,277 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 11:10:26,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 11:10:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 11:10:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2018-12-09 11:10:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 11:10:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 243 transitions. [2018-12-09 11:10:26,289 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 243 transitions. Word has length 135 [2018-12-09 11:10:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:26,289 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 243 transitions. [2018-12-09 11:10:26,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 11:10:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 243 transitions. [2018-12-09 11:10:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 11:10:26,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:26,291 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:26,291 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:26,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash -789289505, now seen corresponding path program 2 times [2018-12-09 11:10:26,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:26,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:26,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 169 proven. 13 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-12-09 11:10:26,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:26,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:26,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 11:10:26,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 11:10:26,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:10:26,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 83 proven. 92 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-09 11:10:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-09 11:10:26,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 11:10:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 11:10:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:10:26,476 INFO L87 Difference]: Start difference. First operand 139 states and 243 transitions. Second operand 17 states. [2018-12-09 11:10:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:26,852 INFO L93 Difference]: Finished difference Result 349 states and 782 transitions. [2018-12-09 11:10:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 11:10:26,853 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2018-12-09 11:10:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:26,854 INFO L225 Difference]: With dead ends: 349 [2018-12-09 11:10:26,854 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 11:10:26,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 11:10:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 11:10:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2018-12-09 11:10:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-09 11:10:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 309 transitions. [2018-12-09 11:10:26,867 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 309 transitions. Word has length 150 [2018-12-09 11:10:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:26,868 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 309 transitions. [2018-12-09 11:10:26,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 11:10:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 309 transitions. [2018-12-09 11:10:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 11:10:26,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:26,869 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:26,869 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:26,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash -950882599, now seen corresponding path program 1 times [2018-12-09 11:10:26,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:26,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:26,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:10:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 85 proven. 85 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-09 11:10:26,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:26,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:26,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 83 proven. 137 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-12-09 11:10:27,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:27,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2018-12-09 11:10:27,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:10:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:10:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:10:27,025 INFO L87 Difference]: Start difference. First operand 174 states and 309 transitions. Second operand 13 states. [2018-12-09 11:10:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:27,246 INFO L93 Difference]: Finished difference Result 341 states and 649 transitions. [2018-12-09 11:10:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:10:27,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 152 [2018-12-09 11:10:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:27,247 INFO L225 Difference]: With dead ends: 341 [2018-12-09 11:10:27,247 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 11:10:27,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2018-12-09 11:10:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 11:10:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-12-09 11:10:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 11:10:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2018-12-09 11:10:27,257 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 152 [2018-12-09 11:10:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:27,257 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2018-12-09 11:10:27,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:10:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2018-12-09 11:10:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 11:10:27,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:27,259 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:27,259 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:27,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 3 times [2018-12-09 11:10:27,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:10:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-09 11:10:27,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:27,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:27,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:10:27,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 11:10:27,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:10:27,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-12-09 11:10:27,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:27,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2018-12-09 11:10:27,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:10:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:10:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:10:27,380 INFO L87 Difference]: Start difference. First operand 122 states and 165 transitions. Second operand 10 states. [2018-12-09 11:10:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:27,462 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2018-12-09 11:10:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:10:27,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2018-12-09 11:10:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:27,463 INFO L225 Difference]: With dead ends: 134 [2018-12-09 11:10:27,463 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 11:10:27,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:10:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 11:10:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-12-09 11:10:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-09 11:10:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions. [2018-12-09 11:10:27,469 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 150 [2018-12-09 11:10:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:27,469 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 168 transitions. [2018-12-09 11:10:27,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:10:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions. [2018-12-09 11:10:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-09 11:10:27,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:27,470 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:27,471 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:27,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash -678687486, now seen corresponding path program 4 times [2018-12-09 11:10:27,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:10:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 250 proven. 120 refuted. 0 times theorem prover too weak. 878 trivial. 0 not checked. [2018-12-09 11:10:27,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:27,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:27,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:10:27,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:10:27,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:10:27,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 250 proven. 118 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-09 11:10:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-12-09 11:10:27,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:10:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:10:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:10:27,673 INFO L87 Difference]: Start difference. First operand 125 states and 168 transitions. Second operand 14 states. [2018-12-09 11:10:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:27,756 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2018-12-09 11:10:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:10:27,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 218 [2018-12-09 11:10:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:27,757 INFO L225 Difference]: With dead ends: 132 [2018-12-09 11:10:27,757 INFO L226 Difference]: Without dead ends: 125 [2018-12-09 11:10:27,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-12-09 11:10:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-09 11:10:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-09 11:10:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-09 11:10:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2018-12-09 11:10:27,766 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 218 [2018-12-09 11:10:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:27,766 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2018-12-09 11:10:27,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:10:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2018-12-09 11:10:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-09 11:10:27,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:27,769 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:27,769 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:27,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash -455828779, now seen corresponding path program 5 times [2018-12-09 11:10:27,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:27,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:10:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:10:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 157 proven. 290 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2018-12-09 11:10:27,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:10:27,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:10:27,920 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 11:10:27,939 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 11:10:27,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:10:27,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:10:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 612 proven. 126 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-12-09 11:10:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:10:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2018-12-09 11:10:28,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 11:10:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 11:10:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:10:28,001 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand 17 states. [2018-12-09 11:10:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:10:28,351 INFO L93 Difference]: Finished difference Result 298 states and 434 transitions. [2018-12-09 11:10:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 11:10:28,351 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 204 [2018-12-09 11:10:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:10:28,352 INFO L225 Difference]: With dead ends: 298 [2018-12-09 11:10:28,352 INFO L226 Difference]: Without dead ends: 171 [2018-12-09 11:10:28,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 11:10:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-09 11:10:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2018-12-09 11:10:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 11:10:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2018-12-09 11:10:28,359 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 204 [2018-12-09 11:10:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:10:28,359 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2018-12-09 11:10:28,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 11:10:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2018-12-09 11:10:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 11:10:28,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:10:28,361 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:10:28,361 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:10:28,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:10:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 6 times [2018-12-09 11:10:28,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:10:28,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:10:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:28,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:10:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:10:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:10:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:10:28,390 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:10:28,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:10:28 BoogieIcfgContainer [2018-12-09 11:10:28,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:10:28,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:10:28,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:10:28,415 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:10:28,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:10:23" (3/4) ... [2018-12-09 11:10:28,417 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:10:28,458 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f7c31e0-96e1-45bb-a166-d1ba2b660028/bin-2019/uautomizer/witness.graphml [2018-12-09 11:10:28,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:10:28,459 INFO L168 Benchmark]: Toolchain (without parser) took 4984.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:10:28,460 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:10:28,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.34 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:10:28,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 950.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:10:28,460 INFO L168 Benchmark]: Boogie Preprocessor took 10.70 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:10:28,460 INFO L168 Benchmark]: RCFGBuilder took 158.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:10:28,461 INFO L168 Benchmark]: TraceAbstraction took 4638.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.6 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:10:28,461 INFO L168 Benchmark]: Witness Printer took 43.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:10:28,462 INFO L336 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.34 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 950.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.70 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 158.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4638.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -36.6 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * Witness Printer took 43.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. 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 = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) 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); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 4.6s OverallTime, 15 OverallIterations, 17 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 566 SDslu, 2314 SDs, 0 SdLazy, 3127 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1512 GetRequests, 1269 SyntacticMatches, 3 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 152 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2551 ConstructedInterpolants, 0 QuantifiedInterpolants, 543901 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2279 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 7800/9242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...