./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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 ce077c63676f801e14160b963d91b2f98c313404 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 13:36:59,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:36:59,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:36:59,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:36:59,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:36:59,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:36:59,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:36:59,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:36:59,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:36:59,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:36:59,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:36:59,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:36:59,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:36:59,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:36:59,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:36:59,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:36:59,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:36:59,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:36:59,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:36:59,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:36:59,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:36:59,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:36:59,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:36:59,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:36:59,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:36:59,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:36:59,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:36:59,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:36:59,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:36:59,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:36:59,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:36:59,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:36:59,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:36:59,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:36:59,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:36:59,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:36:59,489 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 13:36:59,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:36:59,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:36:59,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:36:59,496 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 13:36:59,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:36:59,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:36:59,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:36:59,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:36:59,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:36:59,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:36:59,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:36:59,500 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_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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 -> ce077c63676f801e14160b963d91b2f98c313404 [2018-11-18 13:36:59,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:36:59,532 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:36:59,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:36:59,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:36:59,536 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:36:59,536 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-18 13:36:59,576 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/data/97aeb7afa/a1eda8edb7ad43e28a2a8320dc975808/FLAG615775a77 [2018-11-18 13:36:59,958 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:36:59,958 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-18 13:36:59,966 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/data/97aeb7afa/a1eda8edb7ad43e28a2a8320dc975808/FLAG615775a77 [2018-11-18 13:37:00,341 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/data/97aeb7afa/a1eda8edb7ad43e28a2a8320dc975808 [2018-11-18 13:37:00,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:37:00,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 13:37:00,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:37:00,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:37:00,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:37:00,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f3464b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00, skipping insertion in model container [2018-11-18 13:37:00,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:37:00,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:37:00,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:37:00,585 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:37:00,621 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:37:00,697 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:37:00,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00 WrapperNode [2018-11-18 13:37:00,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:37:00,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:37:00,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:37:00,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:37:00,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... [2018-11-18 13:37:00,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:37:00,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:37:00,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:37:00,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:37:00,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 13:37:00,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:37:00,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 13:37:00,776 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 13:37:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 13:37:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 13:37:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 13:37:00,780 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 13:37:00,781 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 13:37:00,782 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 13:37:00,783 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 13:37:00,784 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 13:37:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 13:37:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:37:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:37:00,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:37:00,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:37:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:37:00,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 13:37:01,152 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:37:01,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:37:01 BoogieIcfgContainer [2018-11-18 13:37:01,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:37:01,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:37:01,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:37:01,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:37:01,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:37:00" (1/3) ... [2018-11-18 13:37:01,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676847a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:37:01, skipping insertion in model container [2018-11-18 13:37:01,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:37:00" (2/3) ... [2018-11-18 13:37:01,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676847a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:37:01, skipping insertion in model container [2018-11-18 13:37:01,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:37:01" (3/3) ... [2018-11-18 13:37:01,157 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-18 13:37:01,164 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:37:01,170 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:37:01,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:37:01,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:37:01,200 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:37:01,200 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:37:01,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:37:01,200 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:37:01,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:37:01,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:37:01,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:37:01,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:37:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-18 13:37:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:37:01,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:01,220 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1522087756, now seen corresponding path program 1 times [2018-11-18 13:37:01,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:01,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:37:01,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:37:01,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 13:37:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:37:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:37:01,323 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-18 13:37:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:01,342 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2018-11-18 13:37:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:37:01,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 13:37:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:01,350 INFO L225 Difference]: With dead ends: 124 [2018-11-18 13:37:01,350 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 13:37:01,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:37:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 13:37:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 13:37:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 13:37:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-18 13:37:01,376 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 20 [2018-11-18 13:37:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:01,377 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-18 13:37:01,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 13:37:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-18 13:37:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:37:01,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,377 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-18 13:37:01,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1332619352, now seen corresponding path program 1 times [2018-11-18 13:37:01,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:01,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:37:01,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:37:01,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:37:01,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:37:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:37:01,426 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 3 states. [2018-11-18 13:37:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:01,449 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-18 13:37:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:37:01,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 13:37:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:01,451 INFO L225 Difference]: With dead ends: 89 [2018-11-18 13:37:01,452 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 13:37:01,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:37:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 13:37:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 13:37:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 13:37:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2018-11-18 13:37:01,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 31 [2018-11-18 13:37:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:01,458 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-18 13:37:01,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:37:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-11-18 13:37:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:37:01,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,459 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:01,459 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2084215142, now seen corresponding path program 1 times [2018-11-18 13:37:01,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:01,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:37:01,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:37:01,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:37:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:37:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:37:01,549 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 5 states. [2018-11-18 13:37:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:01,605 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-18 13:37:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:37:01,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-18 13:37:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:01,606 INFO L225 Difference]: With dead ends: 96 [2018-11-18 13:37:01,606 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 13:37:01,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:37:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 13:37:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2018-11-18 13:37:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 13:37:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2018-11-18 13:37:01,611 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 39 [2018-11-18 13:37:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:01,612 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2018-11-18 13:37:01,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:37:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2018-11-18 13:37:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:37:01,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,613 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:01,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1357180956, now seen corresponding path program 1 times [2018-11-18 13:37:01,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:01,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:37:01,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:37:01,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:37:01,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:37:01,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:37:01,692 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 5 states. [2018-11-18 13:37:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:01,769 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-11-18 13:37:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:37:01,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-18 13:37:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:01,770 INFO L225 Difference]: With dead ends: 99 [2018-11-18 13:37:01,770 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 13:37:01,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:37:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 13:37:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-18 13:37:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 13:37:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2018-11-18 13:37:01,777 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 42 [2018-11-18 13:37:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:01,777 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2018-11-18 13:37:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:37:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2018-11-18 13:37:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:37:01,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,778 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:01,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1337487629, now seen corresponding path program 1 times [2018-11-18 13:37:01,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:01,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:37:01,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:37:01,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:37:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:37:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:37:01,852 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand 5 states. [2018-11-18 13:37:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:01,915 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-11-18 13:37:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:37:01,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-18 13:37:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:01,917 INFO L225 Difference]: With dead ends: 99 [2018-11-18 13:37:01,917 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 13:37:01,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:37:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 13:37:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-11-18 13:37:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 13:37:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2018-11-18 13:37:01,923 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 42 [2018-11-18 13:37:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:01,923 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2018-11-18 13:37:01,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:37:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2018-11-18 13:37:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:37:01,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:01,924 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:01,924 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:01,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1952639320, now seen corresponding path program 1 times [2018-11-18 13:37:01,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:02,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:02,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:02,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:02,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:02,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:37:02,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:02,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:02,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:37:02,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:02,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:02,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,148 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-18 13:37:02,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 13:37:02,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:02,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:37:02,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-18 13:37:02,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:37:02,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:02,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:02,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-18 13:37:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:02,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:02,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-18 13:37:02,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:37:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:37:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:37:02,260 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 10 states. [2018-11-18 13:37:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:02,411 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2018-11-18 13:37:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:37:02,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-18 13:37:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:02,413 INFO L225 Difference]: With dead ends: 101 [2018-11-18 13:37:02,413 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 13:37:02,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:37:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 13:37:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-11-18 13:37:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 13:37:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2018-11-18 13:37:02,420 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 44 [2018-11-18 13:37:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:02,420 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2018-11-18 13:37:02,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:37:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2018-11-18 13:37:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:37:02,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:02,422 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:02,422 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:02,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1003938405, now seen corresponding path program 1 times [2018-11-18 13:37:02,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:02,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:02,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:02,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:02,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:02,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:37:02,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:02,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:02,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:37:02,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:02,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:02,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,636 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-18 13:37:02,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 13:37:02,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:02,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:37:02,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-18 13:37:02,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:37:02,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:02,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:02,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:02,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-18 13:37:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:02,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:02,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-18 13:37:02,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:37:02,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:37:02,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:37:02,751 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand 10 states. [2018-11-18 13:37:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:02,887 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2018-11-18 13:37:02,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:37:02,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-18 13:37:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:02,888 INFO L225 Difference]: With dead ends: 113 [2018-11-18 13:37:02,888 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 13:37:02,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:37:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 13:37:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-11-18 13:37:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 13:37:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2018-11-18 13:37:02,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 44 [2018-11-18 13:37:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:02,895 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2018-11-18 13:37:02,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:37:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-18 13:37:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 13:37:02,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:02,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:02,897 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:02,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1427651621, now seen corresponding path program 1 times [2018-11-18 13:37:02,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:02,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:02,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:03,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:03,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:03,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:03,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:03,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:37:03,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:37:03,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:37:03,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:37:03,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-11-18 13:37:03,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-18 13:37:03,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 13:37:03,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-18 13:37:03,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 13:37:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-18 13:37:03,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 13:37:03,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-18 13:37:03,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-18 13:37:03,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:37:03,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:03,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 13:37:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:03,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:03,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-18 13:37:03,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:37:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:37:03,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:37:03,216 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand 12 states. [2018-11-18 13:37:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:03,401 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-18 13:37:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:37:03,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 13:37:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:03,403 INFO L225 Difference]: With dead ends: 129 [2018-11-18 13:37:03,403 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 13:37:03,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:37:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 13:37:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2018-11-18 13:37:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 13:37:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2018-11-18 13:37:03,412 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 47 [2018-11-18 13:37:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:03,413 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2018-11-18 13:37:03,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:37:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2018-11-18 13:37:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:37:03,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:03,414 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:03,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:03,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1056391002, now seen corresponding path program 2 times [2018-11-18 13:37:03,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:03,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:03,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:03,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:03,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:37:03,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:37:03,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:37:03,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:03,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:03,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:37:03,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:03,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:03,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:37:03,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:03,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:03,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-18 13:37:03,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 13:37:03,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:03,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 13:37:03,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:03,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-18 13:37:03,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-18 13:37:03,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-18 13:37:03,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:03,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:03,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 13:37:03,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:37:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:37:03,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-18 13:37:03,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-18 13:37:04,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:37:04,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:04,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:04,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-18 13:37:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-11-18 13:37:04,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 13:37:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 13:37:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:37:04,077 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand 18 states. [2018-11-18 13:37:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:04,494 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2018-11-18 13:37:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 13:37:04,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-18 13:37:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:04,495 INFO L225 Difference]: With dead ends: 155 [2018-11-18 13:37:04,496 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 13:37:04,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2018-11-18 13:37:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 13:37:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-11-18 13:37:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 13:37:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2018-11-18 13:37:04,507 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 49 [2018-11-18 13:37:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:04,507 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2018-11-18 13:37:04,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 13:37:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2018-11-18 13:37:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:37:04,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:04,508 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:04,508 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:04,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1957183933, now seen corresponding path program 1 times [2018-11-18 13:37:04,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:04,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:04,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:37:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:04,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:04,647 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:04,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:04,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:04,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:37:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:04,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:37:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:04,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:04,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,735 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-18 13:37:04,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 13:37:04,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:04,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 13:37:04,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:04,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-18 13:37:04,821 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 13:37:04,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-18 13:37:04,878 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:04,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 13:37:04,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:37:04,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:04,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:37:04,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:04,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:37:04,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-18 13:37:04,960 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-18 13:37:05,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:37:05,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:05,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:05,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,078 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-18 13:37:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-11-18 13:37:05,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 13:37:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 13:37:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:37:05,111 INFO L87 Difference]: Start difference. First operand 107 states and 136 transitions. Second operand 18 states. [2018-11-18 13:37:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:05,582 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2018-11-18 13:37:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 13:37:05,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-11-18 13:37:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:05,583 INFO L225 Difference]: With dead ends: 178 [2018-11-18 13:37:05,583 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 13:37:05,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 13:37:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 13:37:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2018-11-18 13:37:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 13:37:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2018-11-18 13:37:05,589 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 49 [2018-11-18 13:37:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:05,590 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2018-11-18 13:37:05,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 13:37:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2018-11-18 13:37:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:37:05,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:05,591 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:05,591 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:05,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash -442807687, now seen corresponding path program 1 times [2018-11-18 13:37:05,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:05,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:05,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:05,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:05,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:37:05,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:37:05,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:37:05,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:37:05,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-11-18 13:37:05,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-18 13:37:05,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 13:37:05,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-18 13:37:05,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-18 13:37:05,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-18 13:37:05,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 13:37:05,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-18 13:37:05,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-18 13:37:05,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:37:05,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:05,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:05,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 13:37:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:05,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-18 13:37:05,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:37:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:37:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:37:05,822 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand 12 states. [2018-11-18 13:37:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:05,973 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2018-11-18 13:37:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:37:05,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 13:37:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:05,974 INFO L225 Difference]: With dead ends: 149 [2018-11-18 13:37:05,974 INFO L226 Difference]: Without dead ends: 136 [2018-11-18 13:37:05,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:37:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-18 13:37:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-11-18 13:37:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 13:37:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2018-11-18 13:37:05,981 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 50 [2018-11-18 13:37:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:05,981 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2018-11-18 13:37:05,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:37:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2018-11-18 13:37:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:37:05,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:05,982 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:05,982 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:05,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash -423114360, now seen corresponding path program 2 times [2018-11-18 13:37:05,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:05,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:06,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:06,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:06,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:37:06,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:37:06,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:37:06,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:06,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:06,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:06,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:06,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:06,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:18 [2018-11-18 13:37:06,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-18 13:37:06,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 13:37:06,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-18 13:37:06,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 13:37:06,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 13:37:06,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 13:37:06,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 13:37:06,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-11-18 13:37:06,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:37:06,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:06,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 13:37:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:06,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-18 13:37:06,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:37:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:37:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:37:06,194 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand 9 states. [2018-11-18 13:37:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:06,330 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2018-11-18 13:37:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:37:06,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-18 13:37:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:06,330 INFO L225 Difference]: With dead ends: 142 [2018-11-18 13:37:06,330 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 13:37:06,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:37:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 13:37:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2018-11-18 13:37:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 13:37:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-18 13:37:06,335 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 50 [2018-11-18 13:37:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:06,336 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-18 13:37:06,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:37:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-18 13:37:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:37:06,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:06,336 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:06,337 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:06,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1127121116, now seen corresponding path program 1 times [2018-11-18 13:37:06,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:06,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:06,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:37:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:06,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:06,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:06,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:06,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:06,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:06,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:37:06,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:06,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:06,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:37:06,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:06,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,518 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-18 13:37:06,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 13:37:06,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:06,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 13:37:06,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:06,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-18 13:37:06,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-18 13:37:06,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-18 13:37:06,649 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:06,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 13:37:06,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:37:06,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:37:06,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-18 13:37:06,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-18 13:37:06,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:06,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-11-18 13:37:06,768 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 13:37:06,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 13:37:06,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:06,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-18 13:37:06,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:06,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:06,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:06,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:37:06,810 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2018-11-18 13:37:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:06,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:06,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-11-18 13:37:06,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 13:37:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 13:37:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-18 13:37:06,838 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 17 states. [2018-11-18 13:37:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:07,143 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2018-11-18 13:37:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:37:07,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-18 13:37:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:07,144 INFO L225 Difference]: With dead ends: 127 [2018-11-18 13:37:07,144 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 13:37:07,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-11-18 13:37:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 13:37:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-11-18 13:37:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 13:37:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2018-11-18 13:37:07,149 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 52 [2018-11-18 13:37:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:07,149 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2018-11-18 13:37:07,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 13:37:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2018-11-18 13:37:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:37:07,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:07,150 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:07,150 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:07,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1107427789, now seen corresponding path program 3 times [2018-11-18 13:37:07,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:37:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:37:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:37:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:37:07,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/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-11-18 13:37:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:37:07,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 13:37:07,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:37:07,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:37:07,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:37:07,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:37:07,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:37:07,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-18 13:37:07,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:07,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:07,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:37:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:37:07,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-18 13:37:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-18 13:37:07,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-11-18 13:37:07,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 13:37:07,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:60 [2018-11-18 13:37:07,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 110 [2018-11-18 13:37:07,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-18 13:37:07,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 83 [2018-11-18 13:37:07,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-18 13:37:07,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:83 [2018-11-18 13:37:07,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-11-18 13:37:07,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-18 13:37:07,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:37:07,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:87 [2018-11-18 13:37:07,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:37:07,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2018-11-18 13:37:07,568 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2018-11-18 13:37:07,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 13:37:07,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-18 13:37:07,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2018-11-18 13:37:07,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 13:37:07,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 13:37:07,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-18 13:37:07,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 13:37:07,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-18 13:37:07,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-18 13:37:07,628 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,633 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 13:37:07,646 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:98, output treesize:45 [2018-11-18 13:37:07,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:37:07,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:37:07,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:37:07,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:37:07,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-18 13:37:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:37:07,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:37:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-11-18 13:37:07,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 13:37:07,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 13:37:07,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:37:07,728 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand 18 states. [2018-11-18 13:37:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:37:08,291 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2018-11-18 13:37:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:37:08,291 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-11-18 13:37:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:37:08,292 INFO L225 Difference]: With dead ends: 157 [2018-11-18 13:37:08,292 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 13:37:08,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-11-18 13:37:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 13:37:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-11-18 13:37:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 13:37:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2018-11-18 13:37:08,301 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 52 [2018-11-18 13:37:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:37:08,301 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2018-11-18 13:37:08,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 13:37:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2018-11-18 13:37:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:37:08,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:37:08,302 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:37:08,302 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:37:08,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:37:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash -560579103, now seen corresponding path program 1 times [2018-11-18 13:37:08,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:37:08,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:37:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:08,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:37:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:37:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:37:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:37:08,338 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 13:37:08,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:37:08 BoogieIcfgContainer [2018-11-18 13:37:08,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:37:08,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:37:08,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:37:08,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:37:08,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:37:01" (3/4) ... [2018-11-18 13:37:08,379 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 13:37:08,421 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_51dbcf39-2a9c-4d81-a452-1a8a41ade325/bin-2019/uautomizer/witness.graphml [2018-11-18 13:37:08,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:37:08,422 INFO L168 Benchmark]: Toolchain (without parser) took 8077.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -73.8 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,423 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:37:08,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,423 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,423 INFO L168 Benchmark]: RCFGBuilder took 413.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,423 INFO L168 Benchmark]: TraceAbstraction took 7220.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,424 INFO L168 Benchmark]: Witness Printer took 46.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:37:08,424 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 413.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7220.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. * Witness Printer took 46.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] EXPR, FCALL malloc(sizeof(*root)) [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] FCALL root->left = ((void *)0) [L543] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={11:0}, root={11:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={11:0}, n={0:0}, root={11:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={11:0}, n={11:0}, pred={0:0}, root={11:0}] [L568] EXPR, FCALL n->left [L568] n->left || n->right [L568] EXPR, FCALL n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={11:0}, n={11:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={11:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={11:0}, n={11:0}, pred={0:0}, root={0:0}] [L582] FCALL free(n) VAL [malloc(sizeof(*root))={11:0}, n={11:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={11:0}, n={11:0}, pred={0:0}, root={0:0}] [L584] EXPR, FCALL malloc(sizeof(struct node)) [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] FCALL p->h = 1 [L590] EXPR, FCALL malloc(sizeof(struct node)) [L590] t = (List) malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, pred={0:0}, root={0:0}, t={10:0}] [L591] COND FALSE !(t == 0) VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, pred={0:0}, root={0:0}, t={10:0}] [L592] FCALL p->n = t [L593] EXPR, FCALL p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] FCALL p->h = 2 [L597] EXPR, FCALL malloc(sizeof(struct node)) [L597] t = (List) malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={10:0}, pred={0:0}, root={0:0}, t={14:0}] [L598] COND FALSE !(t == 0) VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={10:0}, pred={0:0}, root={0:0}, t={14:0}] [L599] FCALL p->n = t [L600] EXPR, FCALL p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] FCALL p->h = 3 [L603] p = a VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, pred={0:0}, root={0:0}, t={14:0}] [L604] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, p->h=1, pred={0:0}, root={0:0}, t={14:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={13:0}, p->h=1, pred={0:0}, root={0:0}, t={14:0}] [L606] COND TRUE p->h == 1 [L607] EXPR, FCALL p->n [L607] p = p->n [L606] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={10:0}, p->h=2, pred={0:0}, root={0:0}, t={14:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={10:0}, p->h=2, pred={0:0}, root={0:0}, t={14:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={13:0}, malloc(sizeof(*root))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={13:0}, n={11:0}, p={10:0}, pred={0:0}, root={0:0}, t={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. UNSAFE Result, 7.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 979 SDtfs, 1365 SDslu, 5189 SDs, 0 SdLazy, 2270 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 403 SyntacticMatches, 29 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=14, 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.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 291 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1025 ConstructedInterpolants, 43 QuantifiedInterpolants, 386901 SizeOfPredicates, 101 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 64/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...