./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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 9d5c9e73019496cf8de6b5e77c9588d54710972f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-10-27 00:41:47,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:41:47,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:41:47,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:41:47,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:41:47,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:41:47,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:41:47,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:41:47,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:41:47,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:41:47,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:41:47,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:41:47,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:41:47,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:41:47,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:41:47,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:41:47,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:41:47,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:41:47,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:41:47,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:41:47,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:41:47,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:41:47,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:41:47,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:41:47,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:41:47,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:41:47,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:41:47,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:41:47,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:41:47,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:41:47,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:41:47,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:41:47,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:41:47,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:41:47,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:41:47,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:41:47,706 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-27 00:41:47,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:41:47,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:41:47,719 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:41:47,719 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:41:47,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:41:47,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:41:47,720 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 00:41:47,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:41:47,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:41:47,720 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:41:47,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:41:47,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:41:47,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:41:47,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:41:47,722 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:41:47,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 00:41:47,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:41:47,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:41:47,723 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_ef60dfde-d211-474c-ad78-3514803986b0/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 -> 9d5c9e73019496cf8de6b5e77c9588d54710972f [2018-10-27 00:41:47,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:41:47,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:41:47,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:41:47,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:41:47,777 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:41:47,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-10-27 00:41:47,837 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/data/40e47e9e5/4229613776a5439da46aa6b2f3509f2b/FLAG4aab04662 [2018-10-27 00:41:48,247 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:41:48,247 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/sv-benchmarks/c/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-10-27 00:41:48,259 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/data/40e47e9e5/4229613776a5439da46aa6b2f3509f2b/FLAG4aab04662 [2018-10-27 00:41:48,280 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/data/40e47e9e5/4229613776a5439da46aa6b2f3509f2b [2018-10-27 00:41:48,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:41:48,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:41:48,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:41:48,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:41:48,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:41:48,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cb25ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48, skipping insertion in model container [2018-10-27 00:41:48,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:41:48,342 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:41:48,608 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:41:48,620 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:41:48,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:41:48,704 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:41:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48 WrapperNode [2018-10-27 00:41:48,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:41:48,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:41:48,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:41:48,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:41:48,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... [2018-10-27 00:41:48,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:41:48,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:41:48,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:41:48,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:41:48,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:41:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:41:48,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-27 00:41:48,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 00:41:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 00:41:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 00:41:48,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 00:41:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 00:41:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 00:41:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 00:41:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 00:41:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 00:41:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 00:41:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 00:41:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 00:41:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 00:41:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:41:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:41:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 00:41:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 00:41:49,578 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:41:49,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:41:49 BoogieIcfgContainer [2018-10-27 00:41:49,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:41:49,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:41:49,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:41:49,582 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:41:49,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:41:48" (1/3) ... [2018-10-27 00:41:49,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d0a6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:41:49, skipping insertion in model container [2018-10-27 00:41:49,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:41:48" (2/3) ... [2018-10-27 00:41:49,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d0a6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:41:49, skipping insertion in model container [2018-10-27 00:41:49,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:41:49" (3/3) ... [2018-10-27 00:41:49,585 INFO L112 eAbstractionObserver]: Analyzing ICFG list_false-unreach-call_false-valid-memcleanup.i [2018-10-27 00:41:49,595 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:41:49,603 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:41:49,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:41:49,647 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 00:41:49,647 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:41:49,648 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:41:49,648 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:41:49,648 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:41:49,653 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:41:49,653 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:41:49,653 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:41:49,653 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:41:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-10-27 00:41:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 00:41:49,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:49,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:41:49,676 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:49,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:49,682 INFO L82 PathProgramCache]: Analyzing trace with hash 334538719, now seen corresponding path program 1 times [2018-10-27 00:41:49,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:49,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:41:49,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 00:41:49,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 00:41:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 00:41:49,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:41:49,837 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-10-27 00:41:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:49,863 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-10-27 00:41:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 00:41:49,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-10-27 00:41:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:49,872 INFO L225 Difference]: With dead ends: 89 [2018-10-27 00:41:49,873 INFO L226 Difference]: Without dead ends: 45 [2018-10-27 00:41:49,877 INFO L605 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-10-27 00:41:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-27 00:41:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-27 00:41:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-27 00:41:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-10-27 00:41:49,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 18 [2018-10-27 00:41:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:49,916 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-10-27 00:41:49,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 00:41:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-10-27 00:41:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 00:41:49,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:49,920 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] [2018-10-27 00:41:49,920 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:49,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash -916226017, now seen corresponding path program 1 times [2018-10-27 00:41:49,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:49,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:50,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:41:50,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:41:50,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:41:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:41:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:41:50,193 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-10-27 00:41:50,514 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-27 00:41:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:50,577 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-10-27 00:41:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:41:50,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-10-27 00:41:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:50,579 INFO L225 Difference]: With dead ends: 109 [2018-10-27 00:41:50,579 INFO L226 Difference]: Without dead ends: 105 [2018-10-27 00:41:50,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:41:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-27 00:41:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2018-10-27 00:41:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 00:41:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-10-27 00:41:50,589 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 26 [2018-10-27 00:41:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:50,589 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-10-27 00:41:50,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:41:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-10-27 00:41:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 00:41:50,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:50,590 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:41:50,590 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:50,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash -43532029, now seen corresponding path program 1 times [2018-10-27 00:41:50,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:50,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:41:50,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:41:50,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:41:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:41:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:41:50,947 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 6 states. [2018-10-27 00:41:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:51,296 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-10-27 00:41:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:41:51,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 00:41:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:51,297 INFO L225 Difference]: With dead ends: 112 [2018-10-27 00:41:51,297 INFO L226 Difference]: Without dead ends: 98 [2018-10-27 00:41:51,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:41:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-27 00:41:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 59. [2018-10-27 00:41:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 00:41:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-10-27 00:41:51,304 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 31 [2018-10-27 00:41:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:51,304 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-10-27 00:41:51,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:41:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-10-27 00:41:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 00:41:51,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:51,305 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:41:51,305 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -754876232, now seen corresponding path program 1 times [2018-10-27 00:41:51,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:51,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:41:51,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:41:51,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:41:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:41:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:41:51,402 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2018-10-27 00:41:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:51,563 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-10-27 00:41:51,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 00:41:51,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 00:41:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:51,564 INFO L225 Difference]: With dead ends: 96 [2018-10-27 00:41:51,564 INFO L226 Difference]: Without dead ends: 79 [2018-10-27 00:41:51,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:41:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-27 00:41:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2018-10-27 00:41:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 00:41:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-27 00:41:51,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 31 [2018-10-27 00:41:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:51,570 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-27 00:41:51,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:41:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-27 00:41:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 00:41:51,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:51,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:41:51,572 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash 232163814, now seen corresponding path program 1 times [2018-10-27 00:41:51,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:51,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:51,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:51,816 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:51,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:51,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:51,889 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-10-27 00:41:51,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:51,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:51,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 00:41:51,909 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-10-27 00:41:51,912 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-10-27 00:41:51,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:51,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:51,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:51,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:52,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:52,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:52,014 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-10-27 00:41:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-27 00:41:52,081 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 13 treesize of output 10 [2018-10-27 00:41:52,090 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 10 treesize of output 9 [2018-10-27 00:41:52,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 00:41:52,131 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 20 treesize of output 16 [2018-10-27 00:41:52,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 4 [2018-10-27 00:41:52,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-10-27 00:41:52,197 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-10-27 00:41:52,211 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-10-27 00:41:52,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,265 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-10-27 00:41:52,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:52,422 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-10-27 00:41:52,429 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-10-27 00:41:52,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,435 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-10-27 00:41:52,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:52,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 00:41:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:52,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:41:52,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-10-27 00:41:52,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 00:41:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 00:41:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:41:52,491 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-10-27 00:41:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:53,361 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-10-27 00:41:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 00:41:53,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-27 00:41:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:53,363 INFO L225 Difference]: With dead ends: 130 [2018-10-27 00:41:53,363 INFO L226 Difference]: Without dead ends: 121 [2018-10-27 00:41:53,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 00:41:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-27 00:41:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 66. [2018-10-27 00:41:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 00:41:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-10-27 00:41:53,371 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 36 [2018-10-27 00:41:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:53,372 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-10-27 00:41:53,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 00:41:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-10-27 00:41:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 00:41:53,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:53,373 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:41:53,375 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:53,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -801630408, now seen corresponding path program 1 times [2018-10-27 00:41:53,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:53,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:53,583 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:53,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:53,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:53,654 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-10-27 00:41:53,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 00:41:53,697 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-10-27 00:41:53,699 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-10-27 00:41:53,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:53,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:53,734 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:53,735 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-10-27 00:41:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-27 00:41:53,777 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 13 treesize of output 10 [2018-10-27 00:41:53,780 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 10 treesize of output 9 [2018-10-27 00:41:53,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 00:41:53,808 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 20 treesize of output 16 [2018-10-27 00:41:53,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 4 [2018-10-27 00:41:53,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-10-27 00:41:53,860 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-10-27 00:41:53,862 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-10-27 00:41:53,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:53,873 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-10-27 00:41:53,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:54,014 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-10-27 00:41:54,016 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-10-27 00:41:54,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:54,030 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-10-27 00:41:54,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:54,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:54,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:54,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 00:41:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:41:54,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-10-27 00:41:54,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 00:41:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 00:41:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:41:54,072 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 20 states. [2018-10-27 00:41:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:55,089 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-10-27 00:41:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 00:41:55,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-27 00:41:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:55,090 INFO L225 Difference]: With dead ends: 142 [2018-10-27 00:41:55,090 INFO L226 Difference]: Without dead ends: 138 [2018-10-27 00:41:55,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 00:41:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-27 00:41:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2018-10-27 00:41:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-27 00:41:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-10-27 00:41:55,097 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 36 [2018-10-27 00:41:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:55,097 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-10-27 00:41:55,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 00:41:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-10-27 00:41:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 00:41:55,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:55,098 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:41:55,099 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:55,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:55,099 INFO L82 PathProgramCache]: Analyzing trace with hash 939965340, now seen corresponding path program 1 times [2018-10-27 00:41:55,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:55,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:55,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:55,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:55,264 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:55,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:55,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:55,330 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-10-27 00:41:55,332 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-10-27 00:41:55,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,341 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-10-27 00:41:55,343 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-10-27 00:41:55,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-10-27 00:41:55,377 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-10-27 00:41:55,379 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-10-27 00:41:55,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-10-27 00:41:55,422 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-10-27 00:41:55,424 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-10-27 00:41:55,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,430 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-10-27 00:41:55,432 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-10-27 00:41:55,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-10-27 00:41:55,446 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-10-27 00:41:55,448 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-10-27 00:41:55,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:55,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 00:41:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:55,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:41:55,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-10-27 00:41:55,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 00:41:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 00:41:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-10-27 00:41:55,477 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 17 states. [2018-10-27 00:41:56,177 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 00:41:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:56,549 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-10-27 00:41:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 00:41:56,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-10-27 00:41:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:56,551 INFO L225 Difference]: With dead ends: 136 [2018-10-27 00:41:56,551 INFO L226 Difference]: Without dead ends: 132 [2018-10-27 00:41:56,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-10-27 00:41:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-27 00:41:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 89. [2018-10-27 00:41:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-27 00:41:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-10-27 00:41:56,559 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 41 [2018-10-27 00:41:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:56,559 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-10-27 00:41:56,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 00:41:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-10-27 00:41:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 00:41:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:56,561 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:41:56,561 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:56,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash -243093110, now seen corresponding path program 1 times [2018-10-27 00:41:56,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:56,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:56,711 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:56,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:56,778 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-10-27 00:41:56,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:56,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:56,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 00:41:57,082 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-10-27 00:41:57,093 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-10-27 00:41:57,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:57,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:57,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:41:57,198 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-10-27 00:41:57,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-27 00:41:57,256 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 13 treesize of output 10 [2018-10-27 00:41:57,259 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 10 treesize of output 9 [2018-10-27 00:41:57,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 00:41:57,298 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 20 treesize of output 16 [2018-10-27 00:41:57,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 4 [2018-10-27 00:41:57,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-10-27 00:41:57,333 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-10-27 00:41:57,335 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-10-27 00:41:57,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,343 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-10-27 00:41:57,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-10-27 00:41:57,386 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-10-27 00:41:57,388 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-10-27 00:41:57,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,393 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-10-27 00:41:57,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:57,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 00:41:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:57,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:41:57,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-10-27 00:41:57,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 00:41:57,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 00:41:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-10-27 00:41:57,423 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 20 states. [2018-10-27 00:41:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:58,071 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2018-10-27 00:41:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 00:41:58,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-27 00:41:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:58,072 INFO L225 Difference]: With dead ends: 153 [2018-10-27 00:41:58,072 INFO L226 Difference]: Without dead ends: 139 [2018-10-27 00:41:58,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 00:41:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-27 00:41:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 92. [2018-10-27 00:41:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-27 00:41:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-10-27 00:41:58,081 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 41 [2018-10-27 00:41:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:58,082 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-10-27 00:41:58,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 00:41:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-10-27 00:41:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 00:41:58,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:58,083 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:41:58,084 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:58,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -954437313, now seen corresponding path program 1 times [2018-10-27 00:41:58,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:58,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:58,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:58,640 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 00:41:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:58,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:58,968 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:58,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:58,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:59,007 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-10-27 00:41:59,008 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-10-27 00:41:59,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,017 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-10-27 00:41:59,020 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-10-27 00:41:59,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-10-27 00:41:59,062 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-10-27 00:41:59,064 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-10-27 00:41:59,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-10-27 00:41:59,154 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-10-27 00:41:59,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 25 treesize of output 13 [2018-10-27 00:41:59,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,201 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-10-27 00:41:59,203 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-10-27 00:41:59,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-10-27 00:41:59,217 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-10-27 00:41:59,241 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-10-27 00:41:59,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 00:41:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:59,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:41:59,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-10-27 00:41:59,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 00:41:59,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 00:41:59,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-10-27 00:41:59,279 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 17 states. [2018-10-27 00:41:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:41:59,637 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-10-27 00:41:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 00:41:59,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-10-27 00:41:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:41:59,638 INFO L225 Difference]: With dead ends: 139 [2018-10-27 00:41:59,638 INFO L226 Difference]: Without dead ends: 135 [2018-10-27 00:41:59,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-10-27 00:41:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-27 00:41:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2018-10-27 00:41:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 00:41:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-10-27 00:41:59,647 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 41 [2018-10-27 00:41:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:41:59,648 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-10-27 00:41:59,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 00:41:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-10-27 00:41:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:41:59,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:41:59,649 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-10-27 00:41:59,653 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:41:59,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:41:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1075893338, now seen corresponding path program 2 times [2018-10-27 00:41:59,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:41:59,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:41:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:59,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:41:59,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:41:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:41:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:41:59,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:41:59,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:41:59,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 00:41:59,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 00:41:59,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:41:59,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:41:59,898 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-10-27 00:41:59,906 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-10-27 00:41:59,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,916 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-10-27 00:41:59,918 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-10-27 00:41:59,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-10-27 00:41:59,968 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-10-27 00:41:59,970 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-10-27 00:41:59,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-10-27 00:41:59,993 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-10-27 00:41:59,996 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-10-27 00:41:59,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:41:59,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,002 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-10-27 00:42:00,004 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-10-27 00:42:00,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-10-27 00:42:00,019 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-10-27 00:42:00,029 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-10-27 00:42:00,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 00:42:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:00,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:00,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 00:42:00,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 00:42:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 00:42:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-27 00:42:00,061 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 13 states. [2018-10-27 00:42:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:00,364 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-10-27 00:42:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 00:42:00,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-27 00:42:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:00,365 INFO L225 Difference]: With dead ends: 144 [2018-10-27 00:42:00,365 INFO L226 Difference]: Without dead ends: 130 [2018-10-27 00:42:00,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-10-27 00:42:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-27 00:42:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 97. [2018-10-27 00:42:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 00:42:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-10-27 00:42:00,376 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2018-10-27 00:42:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:00,376 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-10-27 00:42:00,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 00:42:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-10-27 00:42:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:42:00,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:00,381 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 00:42:00,381 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:00,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1787237541, now seen corresponding path program 1 times [2018-10-27 00:42:00,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:00,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:00,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:00,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 00:42:00,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:00,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:00,715 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:42:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:00,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:00,793 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-10-27 00:42:00,795 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-10-27 00:42:00,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,808 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-10-27 00:42:00,810 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-10-27 00:42:00,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-10-27 00:42:00,847 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-10-27 00:42:00,849 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-10-27 00:42:00,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-10-27 00:42:00,882 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-10-27 00:42:00,884 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-10-27 00:42:00,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,890 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-10-27 00:42:00,893 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-10-27 00:42:00,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-10-27 00:42:00,907 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-10-27 00:42:00,909 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-10-27 00:42:00,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:00,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 00:42:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:00,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-10-27 00:42:00,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 00:42:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 00:42:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:42:00,984 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 18 states. [2018-10-27 00:42:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:01,418 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-10-27 00:42:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 00:42:01,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-10-27 00:42:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:01,420 INFO L225 Difference]: With dead ends: 128 [2018-10-27 00:42:01,420 INFO L226 Difference]: Without dead ends: 106 [2018-10-27 00:42:01,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2018-10-27 00:42:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-27 00:42:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2018-10-27 00:42:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-27 00:42:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-10-27 00:42:01,428 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 46 [2018-10-27 00:42:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:01,429 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-10-27 00:42:01,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 00:42:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-10-27 00:42:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:42:01,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:01,430 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:42:01,430 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:01,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1721321197, now seen corresponding path program 2 times [2018-10-27 00:42:01,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:01,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:01,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:01,794 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:42:01,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 00:42:01,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 00:42:01,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:42:01,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:01,822 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-10-27 00:42:01,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 00:42:01,864 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-10-27 00:42:01,865 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-10-27 00:42:01,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 00:42:01,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:01,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:01,907 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-10-27 00:42:01,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2018-10-27 00:42:01,974 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 13 treesize of output 10 [2018-10-27 00:42:01,976 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 10 treesize of output 9 [2018-10-27 00:42:01,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:01,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-10-27 00:42:02,078 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:02,081 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 26 [2018-10-27 00:42:02,085 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 14 treesize of output 13 [2018-10-27 00:42:02,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:59 [2018-10-27 00:42:02,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:02,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:02,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:02,132 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 22 treesize of output 25 [2018-10-27 00:42:02,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:57 [2018-10-27 00:42:02,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:02,219 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 56 treesize of output 57 [2018-10-27 00:42:02,221 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 10 treesize of output 9 [2018-10-27 00:42:02,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:69 [2018-10-27 00:42:02,281 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-10-27 00:42:02,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-10-27 00:42:02,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:02,292 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 24 treesize of output 9 [2018-10-27 00:42:02,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:02,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:02,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:87, output treesize:30 [2018-10-27 00:42:02,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-10-27 00:42:02,390 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-10-27 00:42:02,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:02,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:02,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2018-10-27 00:42:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2018-10-27 00:42:02,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 00:42:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 00:42:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 00:42:02,558 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 37 states. [2018-10-27 00:42:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:04,435 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-10-27 00:42:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 00:42:04,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-10-27 00:42:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:04,436 INFO L225 Difference]: With dead ends: 186 [2018-10-27 00:42:04,436 INFO L226 Difference]: Without dead ends: 175 [2018-10-27 00:42:04,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=770, Invalid=4060, Unknown=0, NotChecked=0, Total=4830 [2018-10-27 00:42:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-27 00:42:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 117. [2018-10-27 00:42:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 00:42:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-10-27 00:42:04,443 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 46 [2018-10-27 00:42:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:04,444 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-10-27 00:42:04,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 00:42:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-10-27 00:42:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:42:04,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:04,445 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-10-27 00:42:04,445 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:04,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash 517096344, now seen corresponding path program 2 times [2018-10-27 00:42:04,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:04,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:04,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 00:42:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:04,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:04,596 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/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-10-27 00:42:04,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 00:42:04,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 00:42:04,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:42:04,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:04,638 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-10-27 00:42:04,643 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-10-27 00:42:04,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,656 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-10-27 00:42:04,659 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-10-27 00:42:04,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-10-27 00:42:04,682 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-10-27 00:42:04,683 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-10-27 00:42:04,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-10-27 00:42:04,704 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-10-27 00:42:04,706 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-10-27 00:42:04,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,712 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-10-27 00:42:04,713 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-10-27 00:42:04,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-10-27 00:42:04,726 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-10-27 00:42:04,728 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-10-27 00:42:04,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:04,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 00:42:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:04,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:04,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 00:42:04,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 00:42:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 00:42:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-27 00:42:04,763 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 13 states. [2018-10-27 00:42:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:05,105 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-10-27 00:42:05,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 00:42:05,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-27 00:42:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:05,107 INFO L225 Difference]: With dead ends: 153 [2018-10-27 00:42:05,107 INFO L226 Difference]: Without dead ends: 131 [2018-10-27 00:42:05,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-10-27 00:42:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-27 00:42:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-10-27 00:42:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-27 00:42:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-10-27 00:42:05,112 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 46 [2018-10-27 00:42:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:05,112 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-10-27 00:42:05,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 00:42:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-10-27 00:42:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 00:42:05,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:05,115 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 00:42:05,115 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:05,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 191878591, now seen corresponding path program 1 times [2018-10-27 00:42:05,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:05,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:05,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:05,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 00:42:05,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:05,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:05,498 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:42:05,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:05,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:05,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 6 treesize of output 5 [2018-10-27 00:42:05,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 00:42:05,559 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-10-27 00:42:05,561 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-10-27 00:42:05,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 00:42:05,594 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:05,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:05,595 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-10-27 00:42:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-10-27 00:42:05,681 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 13 treesize of output 10 [2018-10-27 00:42:05,683 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 10 treesize of output 9 [2018-10-27 00:42:05,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-27 00:42:05,728 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 20 treesize of output 16 [2018-10-27 00:42:05,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 4 [2018-10-27 00:42:05,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-10-27 00:42:05,767 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-10-27 00:42:05,768 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-10-27 00:42:05,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 00:42:05,840 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 13 treesize of output 10 [2018-10-27 00:42:05,842 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-10-27 00:42:05,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-10-27 00:42:05,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-10-27 00:42:05,890 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 3 [2018-10-27 00:42:05,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:05,898 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-10-27 00:42:05,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-10-27 00:42:05,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:05,979 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-10-27 00:42:05,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-10-27 00:42:05,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:06,041 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-10-27 00:42:06,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 00:42:06,121 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-10-27 00:42:06,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 00:42:06,167 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-10-27 00:42:06,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-10-27 00:42:06,390 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-10-27 00:42:06,391 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-10-27 00:42:06,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,396 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-10-27 00:42:06,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:06,400 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-10-27 00:42:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:06,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:06,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-10-27 00:42:06,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-27 00:42:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 00:42:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 00:42:06,439 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 36 states. [2018-10-27 00:42:08,344 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-10-27 00:42:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:08,569 INFO L93 Difference]: Finished difference Result 216 states and 232 transitions. [2018-10-27 00:42:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-27 00:42:08,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-10-27 00:42:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:08,571 INFO L225 Difference]: With dead ends: 216 [2018-10-27 00:42:08,571 INFO L226 Difference]: Without dead ends: 210 [2018-10-27 00:42:08,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=684, Invalid=4008, Unknown=0, NotChecked=0, Total=4692 [2018-10-27 00:42:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-27 00:42:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 117. [2018-10-27 00:42:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 00:42:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-10-27 00:42:08,581 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 46 [2018-10-27 00:42:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:08,582 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-10-27 00:42:08,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-27 00:42:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-10-27 00:42:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 00:42:08,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:08,583 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:42:08,583 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:08,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1738274059, now seen corresponding path program 3 times [2018-10-27 00:42:08,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:09,034 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 00:42:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:09,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:09,354 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:42:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 00:42:09,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 00:42:09,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:42:09,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:09,389 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-10-27 00:42:09,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 00:42:09,445 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,447 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-10-27 00:42:09,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-27 00:42:09,503 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 13 treesize of output 10 [2018-10-27 00:42:09,504 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 10 treesize of output 9 [2018-10-27 00:42:09,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,517 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 13 treesize of output 10 [2018-10-27 00:42:09,519 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-10-27 00:42:09,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-10-27 00:42:09,611 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-10-27 00:42:09,613 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-10-27 00:42:09,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-10-27 00:42:09,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,660 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-10-27 00:42:09,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-10-27 00:42:09,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:09,850 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-27 00:42:09,850 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 52 treesize of output 53 [2018-10-27 00:42:09,869 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 10 treesize of output 9 [2018-10-27 00:42:09,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:09,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:10,066 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 36 treesize of output 41 [2018-10-27 00:42:10,068 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 14 treesize of output 13 [2018-10-27 00:42:10,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-10-27 00:42:10,198 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 55 treesize of output 60 [2018-10-27 00:42:10,201 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-10-27 00:42:10,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,217 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-10-27 00:42:10,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:88 [2018-10-27 00:42:10,345 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 92 treesize of output 66 [2018-10-27 00:42:10,348 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 39 treesize of output 28 [2018-10-27 00:42:10,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,356 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2018-10-27 00:42:10,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:10,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:10,371 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 19 treesize of output 15 [2018-10-27 00:42:10,373 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-10-27 00:42:10,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:10,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 00:42:10,381 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2018-10-27 00:42:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:10,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-10-27 00:42:10,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-27 00:42:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 00:42:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 00:42:10,528 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 37 states. [2018-10-27 00:42:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:11,877 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-10-27 00:42:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 00:42:11,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-10-27 00:42:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:11,890 INFO L225 Difference]: With dead ends: 177 [2018-10-27 00:42:11,890 INFO L226 Difference]: Without dead ends: 168 [2018-10-27 00:42:11,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=437, Invalid=3223, Unknown=0, NotChecked=0, Total=3660 [2018-10-27 00:42:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-27 00:42:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-10-27 00:42:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-27 00:42:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-10-27 00:42:11,900 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 51 [2018-10-27 00:42:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:11,900 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-10-27 00:42:11,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-27 00:42:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-10-27 00:42:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 00:42:11,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:11,901 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-27 00:42:11,901 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:11,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:11,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1070591843, now seen corresponding path program 1 times [2018-10-27 00:42:11,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:11,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:11,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:11,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 00:42:11,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:12,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:42:12,163 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:42:12,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:42:12,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:42:12,197 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-10-27 00:42:12,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 00:42:12,210 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-10-27 00:42:12,229 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-10-27 00:42:12,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 00:42:12,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:12,283 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:12,283 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-10-27 00:42:12,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-10-27 00:42:12,350 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 13 treesize of output 10 [2018-10-27 00:42:12,352 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 10 treesize of output 9 [2018-10-27 00:42:12,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-27 00:42:12,390 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 20 treesize of output 16 [2018-10-27 00:42:12,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 4 [2018-10-27 00:42:12,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-10-27 00:42:12,423 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-10-27 00:42:12,425 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-10-27 00:42:12,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-27 00:42:12,505 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 13 treesize of output 10 [2018-10-27 00:42:12,507 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-10-27 00:42:12,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-10-27 00:42:12,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-10-27 00:42:12,543 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 3 [2018-10-27 00:42:12,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:12,551 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-10-27 00:42:12,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-10-27 00:42:12,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:12,624 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-10-27 00:42:12,649 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 00:42:12,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,568 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-10-27 00:42:13,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:13,601 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-10-27 00:42:13,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 00:42:13,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:13,627 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 21 [2018-10-27 00:42:13,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 00:42:13,661 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-10-27 00:42:13,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-10-27 00:42:13,830 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 24 [2018-10-27 00:42:13,832 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-10-27 00:42:13,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,837 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-10-27 00:42:13,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:13,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 00:42:13,856 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 22 treesize of output 24 [2018-10-27 00:42:13,861 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-10-27 00:42:13,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 00:42:13,892 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-10-27 00:42:13,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 00:42:13,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 00:42:13,901 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2018-10-27 00:42:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:42:13,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:42:13,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2018-10-27 00:42:13,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 00:42:13,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 00:42:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 00:42:13,946 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 33 states. [2018-10-27 00:42:14,879 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 00:42:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:42:15,634 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2018-10-27 00:42:15,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 00:42:15,635 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2018-10-27 00:42:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:42:15,636 INFO L225 Difference]: With dead ends: 206 [2018-10-27 00:42:15,636 INFO L226 Difference]: Without dead ends: 192 [2018-10-27 00:42:15,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=563, Invalid=2977, Unknown=0, NotChecked=0, Total=3540 [2018-10-27 00:42:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-27 00:42:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 127. [2018-10-27 00:42:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 00:42:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-10-27 00:42:15,643 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 51 [2018-10-27 00:42:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:42:15,643 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-10-27 00:42:15,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 00:42:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-10-27 00:42:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 00:42:15,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:42:15,644 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-10-27 00:42:15,644 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:42:15,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:42:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 359247640, now seen corresponding path program 1 times [2018-10-27 00:42:15,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:42:15,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:42:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:15,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:42:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:42:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:42:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:42:15,685 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 00:42:15,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:42:15 BoogieIcfgContainer [2018-10-27 00:42:15,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:42:15,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:42:15,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:42:15,718 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:42:15,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:41:49" (3/4) ... [2018-10-27 00:42:15,721 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 00:42:15,768 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ef60dfde-d211-474c-ad78-3514803986b0/bin-2019/uautomizer/witness.graphml [2018-10-27 00:42:15,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:42:15,769 INFO L168 Benchmark]: Toolchain (without parser) took 27485.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 953.2 MB in the beginning and 1.3 GB in the end (delta: -317.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:15,769 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:15,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.67 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 931.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:15,770 INFO L168 Benchmark]: Boogie Preprocessor took 111.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:15,770 INFO L168 Benchmark]: RCFGBuilder took 755.63 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-10-27 00:42:15,770 INFO L168 Benchmark]: TraceAbstraction took 26138.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:15,770 INFO L168 Benchmark]: Witness Printer took 49.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:42:15,771 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.67 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 931.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 755.63 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26138.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 49.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={12:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L628] COND FALSE !(a == 0) VAL [a={12:0}, malloc(sizeof(struct node))={12:0}] [L629] List t; [L630] List p = a; VAL [a={12:0}, malloc(sizeof(struct node))={12:0}, p={12:0}] [L631] COND TRUE __VERIFIER_nondet_int() [L632] FCALL p->h = 1 VAL [a={12:0}, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] EXPR, FCALL malloc(sizeof(struct node)) VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}] [L633] t = (List) malloc(sizeof(struct node)) VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, t={10:0}] [L634] COND FALSE !(t == 0) VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, t={10:0}] [L635] FCALL p->n = t VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, t={10:0}] [L636] EXPR, FCALL p->n VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, p->n={10:0}, t={10:0}] [L636] p = p->n [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND TRUE __VERIFIER_nondet_int() [L639] FCALL p->h = 2 VAL [a={12:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={10:0}] [L640] EXPR, FCALL malloc(sizeof(struct node)) VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={10:0}] [L640] t = (List) malloc(sizeof(struct node)) VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={11:0}] [L641] COND FALSE !(t == 0) VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={11:0}] [L642] FCALL p->n = t VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={11:0}] [L643] EXPR, FCALL p->n VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, p->n={11:0}, t={11:0}] [L643] p = p->n [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={11:0}, t={11:0}] [L646] p = a VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, t={11:0}] [L647] EXPR, FCALL p->h VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=1, t={11:0}] [L647] COND FALSE !(p->h == 2) [L649] EXPR, FCALL p->h VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, p->h=1, t={11:0}] [L649] COND TRUE p->h == 1 [L650] EXPR, FCALL p->n VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={12:0}, p->n={10:0}, t={11:0}] [L650] p = p->n [L649] EXPR, FCALL p->h VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, p->h=2, t={11:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR, FCALL p->h VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, p->h=2, t={11:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, malloc(sizeof(struct node))={12:0}, p={10:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 57 locations, 1 error locations. UNSAFE Result, 26.0s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 3638 SDslu, 8023 SDs, 0 SdLazy, 7162 SolverSat, 504 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 407 SyntacticMatches, 54 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4903 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 685 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1211 NumberOfCodeBlocks, 1211 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1132 ConstructedInterpolants, 51 QuantifiedInterpolants, 600874 SizeOfPredicates, 189 NumberOfNonLiveVariables, 1463 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 56/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...