./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-properties/list_search_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_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/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 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-10 12:51:34,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:51:34,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:51:34,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:51:34,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:51:34,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:51:34,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:51:34,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:51:34,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:51:34,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:51:34,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:51:34,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:51:34,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:51:34,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:51:34,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:51:34,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:51:34,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:51:34,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:51:34,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:51:34,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:51:34,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:51:34,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:51:34,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:51:34,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:51:34,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:51:34,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:51:34,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:51:34,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:51:34,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:51:34,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:51:34,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:51:34,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:51:34,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:51:34,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:51:34,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:51:34,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:51:34,163 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:51:34,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:51:34,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:51:34,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:51:34,174 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:51:34,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:51:34,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:51:34,175 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:51:34,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:51:34,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:51:34,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:51:34,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:51:34,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:51:34,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:51:34,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:51:34,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:51:34,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:51:34,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:51:34,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:51:34,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:51:34,178 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:51:34,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:51:34,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:51:34,178 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_3186b1a9-d9e0-4997-b2e9-a68eaab51506/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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-11-10 12:51:34,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:51:34,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:51:34,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:51:34,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:51:34,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:51:34,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:51:34,249 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/data/e848ea43c/83447aae77c34044b5d07aaa229b6b70/FLAG728efeb1b [2018-11-10 12:51:34,696 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:51:34,697 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:51:34,705 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/data/e848ea43c/83447aae77c34044b5d07aaa229b6b70/FLAG728efeb1b [2018-11-10 12:51:34,714 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/data/e848ea43c/83447aae77c34044b5d07aaa229b6b70 [2018-11-10 12:51:34,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:51:34,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:51:34,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:34,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:51:34,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:51:34,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:34" (1/1) ... [2018-11-10 12:51:34,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb1b920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:34, skipping insertion in model container [2018-11-10 12:51:34,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:51:34" (1/1) ... [2018-11-10 12:51:34,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:51:34,756 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:51:34,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:34,948 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:51:34,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:51:34,999 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:51:35,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35 WrapperNode [2018-11-10 12:51:35,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:51:35,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:51:35,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:51:35,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:51:35,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... [2018-11-10 12:51:35,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:51:35,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:51:35,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:51:35,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:51:35,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:51:35,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:51:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:51:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:51:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-10 12:51:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-10 12:51:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:51:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:51:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:51:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 12:51:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 12:51:35,112 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 12:51:35,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 12:51:35,114 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 12:51:35,115 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 12:51:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 12:51:35,117 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 12:51:35,118 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 12:51:35,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 12:51:35,120 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:51:35,121 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:51:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:51:35,379 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:51:35,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:35 BoogieIcfgContainer [2018-11-10 12:51:35,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:51:35,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:51:35,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:51:35,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:51:35,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:51:34" (1/3) ... [2018-11-10 12:51:35,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa78711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:35, skipping insertion in model container [2018-11-10 12:51:35,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:51:35" (2/3) ... [2018-11-10 12:51:35,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa78711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:51:35, skipping insertion in model container [2018-11-10 12:51:35,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:35" (3/3) ... [2018-11-10 12:51:35,384 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-10 12:51:35,389 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:51:35,394 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:51:35,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:51:35,421 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:51:35,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:51:35,421 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:51:35,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:51:35,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:51:35,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:51:35,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:51:35,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:51:35,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:51:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-10 12:51:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 12:51:35,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:35,438 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:35,440 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:35,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2010327016, now seen corresponding path program 1 times [2018-11-10 12:51:35,445 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:35,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:35,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:35,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:35,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 12:51:35,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:35,650 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:35,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:35,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 12:51:35,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:51:35,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2018-11-10 12:51:35,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:51:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:51:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:51:35,783 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 7 states. [2018-11-10 12:51:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:36,134 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2018-11-10 12:51:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:51:36,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-10 12:51:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:36,141 INFO L225 Difference]: With dead ends: 150 [2018-11-10 12:51:36,141 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 12:51:36,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:51:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 12:51:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-11-10 12:51:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 12:51:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-10 12:51:36,178 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 62 [2018-11-10 12:51:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:36,178 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 12:51:36,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:51:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-10 12:51:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 12:51:36,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:36,180 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:36,180 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:36,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1436068442, now seen corresponding path program 1 times [2018-11-10 12:51:36,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 12:51:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:51:36,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:51:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:51:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:51:36,289 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 8 states. [2018-11-10 12:51:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:36,445 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-10 12:51:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:51:36,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-10 12:51:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:36,449 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:51:36,449 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 12:51:36,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:51:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 12:51:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-10 12:51:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:51:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 12:51:36,455 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 68 [2018-11-10 12:51:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:36,456 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 12:51:36,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:51:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-10 12:51:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 12:51:36,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:36,457 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:36,457 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:36,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 22060259, now seen corresponding path program 1 times [2018-11-10 12:51:36,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:36,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:36,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:36,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 12:51:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:51:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 12:51:36,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:51:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:51:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:51:36,620 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 11 states. [2018-11-10 12:51:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:36,875 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-11-10 12:51:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:51:36,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-10 12:51:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:36,877 INFO L225 Difference]: With dead ends: 79 [2018-11-10 12:51:36,877 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 12:51:36,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:51:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 12:51:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2018-11-10 12:51:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 12:51:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-11-10 12:51:36,884 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 70 [2018-11-10 12:51:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:36,885 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-10 12:51:36,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:51:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-10 12:51:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:51:36,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:36,886 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:36,887 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:36,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash -676290662, now seen corresponding path program 1 times [2018-11-10 12:51:36,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:36,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:36,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:51:37,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:37,128 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:37,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:37,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:37,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:37,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:37,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:37,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:37,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:37,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 12:51:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:51:37,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:37,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 23 [2018-11-10 12:51:37,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 12:51:37,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 12:51:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:51:37,368 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 23 states. [2018-11-10 12:51:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:37,912 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-10 12:51:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 12:51:37,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2018-11-10 12:51:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:37,914 INFO L225 Difference]: With dead ends: 105 [2018-11-10 12:51:37,914 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 12:51:37,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1669, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 12:51:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 12:51:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2018-11-10 12:51:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 12:51:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-10 12:51:37,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 76 [2018-11-10 12:51:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:37,919 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-10 12:51:37,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 12:51:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-10 12:51:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:51:37,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:37,920 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2018-11-10 12:51:37,920 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:37,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 24066519, now seen corresponding path program 1 times [2018-11-10 12:51:37,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:37,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 12:51:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:38,405 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:38,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:38,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:38,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:51:38,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 12:51:38,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:51:38,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:38,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 12:51:38,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:38,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:38,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:38,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:38,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:38,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:38 [2018-11-10 12:51:38,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:38,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:38,789 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 17 treesize of output 10 [2018-11-10 12:51:38,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,799 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 25 treesize of output 32 [2018-11-10 12:51:38,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:38,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:38,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-10 12:51:39,092 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 12:51:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:39,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:39,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:1 [2018-11-10 12:51:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 12:51:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 40 [2018-11-10 12:51:39,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-10 12:51:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 12:51:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1431, Unknown=3, NotChecked=0, Total=1560 [2018-11-10 12:51:39,143 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 40 states. [2018-11-10 12:51:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:40,366 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-11-10 12:51:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 12:51:40,367 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-11-10 12:51:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:40,368 INFO L225 Difference]: With dead ends: 90 [2018-11-10 12:51:40,368 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 12:51:40,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=316, Invalid=3101, Unknown=5, NotChecked=0, Total=3422 [2018-11-10 12:51:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 12:51:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-11-10 12:51:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 12:51:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-10 12:51:40,378 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 78 [2018-11-10 12:51:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:40,378 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 12:51:40,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-10 12:51:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-10 12:51:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 12:51:40,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:40,380 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:40,380 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:40,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2133150322, now seen corresponding path program 2 times [2018-11-10 12:51:40,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:40,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:40,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:40,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:51:40,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:40,891 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:40,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:51:40,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:51:40,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:51:40,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:40,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:51:40,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:40,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:40,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 12:51:40,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:40,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:40,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:40,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:40,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:40,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 12:51:41,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:41,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:41,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 12:51:41,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:41,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:41,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:51:41,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,142 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 24 treesize of output 25 [2018-11-10 12:51:41,144 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-11-10 12:51:41,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:41,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-10 12:51:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 12:51:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:41,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 39 [2018-11-10 12:51:41,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 12:51:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 12:51:41,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 12:51:41,411 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 39 states. [2018-11-10 12:51:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:43,304 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-11-10 12:51:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 12:51:43,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 84 [2018-11-10 12:51:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:43,306 INFO L225 Difference]: With dead ends: 121 [2018-11-10 12:51:43,306 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 12:51:43,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=553, Invalid=4277, Unknown=0, NotChecked=0, Total=4830 [2018-11-10 12:51:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 12:51:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-11-10 12:51:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 12:51:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-10 12:51:43,314 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 84 [2018-11-10 12:51:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:43,314 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-10 12:51:43,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 12:51:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-10 12:51:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 12:51:43,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:43,315 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:43,315 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:43,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 141271755, now seen corresponding path program 2 times [2018-11-10 12:51:43,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:43,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:51:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 27 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:51:44,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:44,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:51:44,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:51:44,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:51:44,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:51:44,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:51:44,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:51:44,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:44,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-10 12:51:44,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:44,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:44,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:44,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:44,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:44,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:44,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:44 [2018-11-10 12:51:44,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,004 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 23 treesize of output 39 [2018-11-10 12:51:45,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,018 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 31 treesize of output 38 [2018-11-10 12:51:45,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 8 treesize of output 7 [2018-11-10 12:51:45,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,030 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:49 [2018-11-10 12:51:45,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 12:51:45,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,362 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 27 treesize of output 32 [2018-11-10 12:51:45,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:45,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,384 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 45 treesize of output 57 [2018-11-10 12:51:45,387 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 22 treesize of output 18 [2018-11-10 12:51:45,387 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:45,408 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 29 treesize of output 36 [2018-11-10 12:51:45,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:45,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,418 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:45,427 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:83, output treesize:74 [2018-11-10 12:51:46,047 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 12:51:46,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:46,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:46,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:128, output treesize:1 [2018-11-10 12:51:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 27 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:51:46,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:46,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33] total 67 [2018-11-10 12:51:46,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-10 12:51:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-10 12:51:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=4222, Unknown=3, NotChecked=0, Total=4422 [2018-11-10 12:51:46,092 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 67 states. [2018-11-10 12:51:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:50,030 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-10 12:51:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 12:51:50,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 86 [2018-11-10 12:51:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:50,031 INFO L225 Difference]: With dead ends: 106 [2018-11-10 12:51:50,031 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 12:51:50,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=710, Invalid=9993, Unknown=9, NotChecked=0, Total=10712 [2018-11-10 12:51:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 12:51:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2018-11-10 12:51:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 12:51:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-10 12:51:50,042 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 86 [2018-11-10 12:51:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:50,043 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-10 12:51:50,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-10 12:51:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-10 12:51:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 12:51:50,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:50,044 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:50,044 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:50,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1314494338, now seen corresponding path program 3 times [2018-11-10 12:51:50,044 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:50,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:50,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:51:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:50,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:50,800 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:50,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:51:50,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 12:51:50,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:51:50,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:50,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 12:51:50,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:50,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:50,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 12:51:50,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:50,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:50,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:50,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:50,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:50,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 12:51:51,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:51:51,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:51,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-10 12:51:51,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:51:51,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-10 12:51:51,180 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-11-10 12:51:51,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:55 [2018-11-10 12:51:51,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 12:51:51,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,392 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 21 treesize of output 22 [2018-11-10 12:51:51,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 12:51:51,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:51,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 59 [2018-11-10 12:51:51,421 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 22 treesize of output 18 [2018-11-10 12:51:51,421 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:51,434 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:80 [2018-11-10 12:51:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:51,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:51,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 55 [2018-11-10 12:51:51,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 12:51:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 12:51:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2800, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 12:51:51,932 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 55 states. [2018-11-10 12:51:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:55,002 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-11-10 12:51:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 12:51:55,003 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 92 [2018-11-10 12:51:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:55,003 INFO L225 Difference]: With dead ends: 129 [2018-11-10 12:51:55,004 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 12:51:55,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=797, Invalid=7393, Unknown=0, NotChecked=0, Total=8190 [2018-11-10 12:51:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 12:51:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2018-11-10 12:51:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 12:51:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-11-10 12:51:55,012 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 92 [2018-11-10 12:51:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:55,012 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-11-10 12:51:55,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 12:51:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-11-10 12:51:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:51:55,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:55,013 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:55,013 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1908004799, now seen corresponding path program 3 times [2018-11-10 12:51:55,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:55,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:55,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:51:55,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:55,065 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:51:55,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:51:55 BoogieIcfgContainer [2018-11-10 12:51:55,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:51:55,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:51:55,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:51:55,109 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:51:55,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:51:35" (3/4) ... [2018-11-10 12:51:55,111 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:51:55,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3186b1a9-d9e0-4997-b2e9-a68eaab51506/bin-2019/uautomizer/witness.graphml [2018-11-10 12:51:55,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:51:55,157 INFO L168 Benchmark]: Toolchain (without parser) took 20440.03 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 535.8 MB). Free memory was 951.1 MB in the beginning and 1.4 GB in the end (delta: -448.5 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:55,157 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:55,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:55,158 INFO L168 Benchmark]: Boogie Preprocessor took 75.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 924.2 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:55,158 INFO L168 Benchmark]: RCFGBuilder took 303.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:55,158 INFO L168 Benchmark]: TraceAbstraction took 19728.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 370.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.1 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:55,159 INFO L168 Benchmark]: Witness Printer took 47.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 12:51:55,163 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 924.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 924.2 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 303.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19728.93 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 370.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.1 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. * Witness Printer took 47.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] mlist *head; VAL [\old(head)=14, \old(head)=17, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={12:13}] [L632] EXPR, FCALL malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={12:13}, l={12:13}, malloc(sizeof(mlist))={15:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={15:0}, l={12:13}, malloc(sizeof(mlist))={15:0}] [L633] FCALL l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={12:13}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L634] COND TRUE head==((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={12:13}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L635] FCALL l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={15:0}, l={12:13}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={15:0}, k=2, l={12:13}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L646] insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,2)=0, mylist={12:13}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=0, \old(head)=15, \old(k)=5, head={15:0}, l={12:13}] [L632] EXPR, FCALL malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=15, \old(k)=5, head={15:0}, k=5, l={12:13}, l={12:13}, malloc(sizeof(mlist))={18:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) VAL [\old(head)=15, \old(head)=0, \old(k)=5, head={15:0}, k=5, l={12:13}, l={18:0}, malloc(sizeof(mlist))={18:0}] [L633] FCALL l->key = k VAL [\old(head)=15, \old(head)=0, \old(k)=5, head={15:0}, k=5, l={12:13}, l={18:0}, malloc(sizeof(mlist))={18:0}] [L634] COND FALSE !(head==((void *)0)) VAL [\old(head)=0, \old(head)=15, \old(k)=5, head={15:0}, k=5, l={12:13}, l={18:0}, malloc(sizeof(mlist))={18:0}] [L637] FCALL l->key = k VAL [\old(head)=0, \old(head)=15, \old(k)=5, head={15:0}, k=5, l={18:0}, l={12:13}, malloc(sizeof(mlist))={18:0}] [L638] FCALL l->next = head VAL [\old(head)=0, \old(head)=15, \old(k)=5, head={15:0}, k=5, l={12:13}, l={18:0}, malloc(sizeof(mlist))={18:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=15, \old(k)=5, \result=0, head={18:0}, k=5, l={12:13}, l={18:0}, malloc(sizeof(mlist))={18:0}] [L647] insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={18:0}, insert_list(mylist,5)=0, mylist={12:13}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=0, \old(head)=18, \old(k)=1, head={18:0}, l={12:13}] [L632] EXPR, FCALL malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=18, \old(k)=1, head={18:0}, k=1, l={12:13}, l={12:13}, malloc(sizeof(mlist))={9:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) VAL [\old(head)=18, \old(head)=0, \old(k)=1, head={18:0}, k=1, l={12:13}, l={9:0}, malloc(sizeof(mlist))={9:0}] [L633] FCALL l->key = k VAL [\old(head)=0, \old(head)=18, \old(k)=1, head={18:0}, k=1, l={12:13}, l={9:0}, malloc(sizeof(mlist))={9:0}] [L634] COND FALSE !(head==((void *)0)) VAL [\old(head)=0, \old(head)=18, \old(k)=1, head={18:0}, k=1, l={9:0}, l={12:13}, malloc(sizeof(mlist))={9:0}] [L637] FCALL l->key = k VAL [\old(head)=18, \old(head)=0, \old(k)=1, head={18:0}, k=1, l={9:0}, l={12:13}, malloc(sizeof(mlist))={9:0}] [L638] FCALL l->next = head VAL [\old(head)=18, \old(head)=0, \old(k)=1, head={18:0}, k=1, l={12:13}, l={9:0}, malloc(sizeof(mlist))={9:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=18, \old(head)=0, \old(k)=1, \result=0, head={9:0}, k=1, l={12:13}, l={9:0}, malloc(sizeof(mlist))={9:0}] [L648] insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={9:0}, insert_list(mylist,1)=0, mylist={12:13}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=9, \old(head)=0, \old(k)=3, head={9:0}, l={12:13}] [L632] EXPR, FCALL malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={12:13}, l={12:13}, malloc(sizeof(mlist))={11:0}] [L632] l = (mlist*)malloc(sizeof(mlist)) VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={11:0}, l={12:13}, malloc(sizeof(mlist))={11:0}] [L633] FCALL l->key = k VAL [\old(head)=9, \old(head)=0, \old(k)=3, head={9:0}, k=3, l={12:13}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L634] COND FALSE !(head==((void *)0)) VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={12:13}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L637] FCALL l->key = k VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={12:13}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L638] FCALL l->next = head VAL [\old(head)=0, \old(head)=9, \old(k)=3, head={9:0}, k=3, l={11:0}, l={12:13}, malloc(sizeof(mlist))={11:0}] [L640] head = l [L641] RET return 0; VAL [\old(head)=0, \old(head)=9, \old(k)=3, \result=0, head={11:0}, k=3, l={12:13}, l={11:0}, malloc(sizeof(mlist))={11:0}] [L649] insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={11:0}, insert_list(mylist,3)=0, mylist={12:13}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, l={11:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={11:0}] [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={11:0}, l!=((void *)0) && l->key!=k=1] [L626] EXPR, FCALL l->key VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={11:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={11:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={11:0}, l->next={9:0}] [L627] l = l->next [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={9:0}, l!=((void *)0) && l->key!=k=1] [L626] EXPR, FCALL l->key VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={9:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={9:0}, l={11:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={9:0}, l={11:0}, l->next={18:0}] [L627] l = l->next [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={18:0}, l!=((void *)0) && l->key!=k=1] [L626] EXPR, FCALL l->key VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={18:0}, l={11:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={18:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR, FCALL l->next VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={18:0}, l={11:0}, l->next={15:0}] [L627] l = l->next [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={15:0}, l!=((void *)0) && l->key!=k=1] [L626] EXPR, FCALL l->key VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={15:0}, l!=((void *)0) && l->key!=k=1, l->key=2] [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={11:0}, k=2, l={11:0}, l={15:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] RET return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={15:0}, head={11:0}, k=2, l={11:0}, l={15:0}] [L650] EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={11:0}, mylist={12:13}, search_list(head,2)={15:0}] [L650] temp = search_list(head,2) [L651] EXPR, FCALL temp->key VAL [\old(head)=0, \old(head)=0, head={11:0}, mylist={12:13}, temp={15:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={11:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={11:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 58 locations, 1 error locations. UNSAFE Result, 19.6s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 1658 SDslu, 2563 SDs, 0 SdLazy, 8877 SolverSat, 490 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 413 SyntacticMatches, 38 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7158 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 144 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1080 ConstructedInterpolants, 12 QuantifiedInterpolants, 1592723 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2088 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 511/920 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...