./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.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_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/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 6054e98f999cfedecdcceeeadabf7a119475d890 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/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 6054e98f999cfedecdcceeeadabf7a119475d890 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 01:03:10,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:03:10,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:03:10,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:03:10,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:03:10,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:03:10,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:03:10,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:03:10,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:03:10,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:03:10,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:03:10,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:03:10,876 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:03:10,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:03:10,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:03:10,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:03:10,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:03:10,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:03:10,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:03:10,884 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:03:10,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:03:10,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:03:10,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:03:10,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:03:10,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:03:10,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:03:10,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:03:10,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:03:10,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:03:10,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:03:10,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:03:10,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:03:10,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:03:10,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:03:10,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:03:10,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:03:10,896 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-27 01:03:10,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:03:10,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:03:10,909 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:03:10,909 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 01:03:10,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 01:03:10,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 01:03:10,910 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 01:03:10,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:03:10,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:03:10,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:03:10,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:03:10,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:03:10,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:03:10,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:03:10,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:10,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:03:10,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 01:03:10,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:03:10,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 01:03:10,916 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_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-10-27 01:03:10,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:03:10,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:03:10,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:03:10,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:03:10,967 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:03:10,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:11,019 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/36104abfa/863d0be38f1a4209bf13391d50202084/FLAGa6020635a [2018-10-27 01:03:11,455 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:03:11,456 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:11,465 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/36104abfa/863d0be38f1a4209bf13391d50202084/FLAGa6020635a [2018-10-27 01:03:11,477 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/36104abfa/863d0be38f1a4209bf13391d50202084 [2018-10-27 01:03:11,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:03:11,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 01:03:11,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:11,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:03:11,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:03:11,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:11,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f743dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11, skipping insertion in model container [2018-10-27 01:03:11,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:11,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:03:11,539 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:03:11,808 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:11,817 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:03:11,860 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:11,901 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:03:11,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11 WrapperNode [2018-10-27 01:03:11,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:11,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:03:11,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:03:11,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:03:11,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:11,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:11,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:11,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:12,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:12,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:12,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... [2018-10-27 01:03:12,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:03:12,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:03:12,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:03:12,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:03:12,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 01:03:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:03:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 01:03:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 01:03:12,090 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-27 01:03:12,091 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-27 01:03:12,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-27 01:03:12,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-27 01:03:12,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-27 01:03:12,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 01:03:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 01:03:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 01:03:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 01:03:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 01:03:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 01:03:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 01:03:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 01:03:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 01:03:12,099 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 01:03:12,100 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 01:03:12,101 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 01:03:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 01:03:12,102 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 01:03:12,103 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 01:03:12,104 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 01:03:12,105 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 01:03:12,106 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 01:03:12,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 01:03:12,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 01:03:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:03:12,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 01:03:13,026 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:03:13,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:13 BoogieIcfgContainer [2018-10-27 01:03:13,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:03:13,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 01:03:13,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 01:03:13,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 01:03:13,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 01:03:11" (1/3) ... [2018-10-27 01:03:13,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b38a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:13, skipping insertion in model container [2018-10-27 01:03:13,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:11" (2/3) ... [2018-10-27 01:03:13,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b38a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:13, skipping insertion in model container [2018-10-27 01:03:13,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:13" (3/3) ... [2018-10-27 01:03:13,036 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:13,047 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 01:03:13,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 01:03:13,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 01:03:13,099 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 01:03:13,100 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 01:03:13,100 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 01:03:13,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 01:03:13,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 01:03:13,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 01:03:13,101 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 01:03:13,101 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 01:03:13,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 01:03:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-10-27 01:03:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 01:03:13,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:13,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:13,131 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:13,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash -960913746, now seen corresponding path program 1 times [2018-10-27 01:03:13,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:13,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:13,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:13,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 01:03:13,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 01:03:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 01:03:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 01:03:13,328 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-10-27 01:03:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:13,366 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2018-10-27 01:03:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 01:03:13,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-10-27 01:03:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:13,379 INFO L225 Difference]: With dead ends: 162 [2018-10-27 01:03:13,379 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 01:03:13,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 01:03:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 01:03:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-27 01:03:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 01:03:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-10-27 01:03:13,437 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 42 [2018-10-27 01:03:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:13,437 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-27 01:03:13,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 01:03:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-10-27 01:03:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 01:03:13,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:13,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:13,441 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:13,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:13,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1636984481, now seen corresponding path program 1 times [2018-10-27 01:03:13,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:13,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:13,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:13,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 01:03:13,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 01:03:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 01:03:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 01:03:13,709 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2018-10-27 01:03:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:13,817 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-10-27 01:03:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 01:03:13,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-27 01:03:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:13,818 INFO L225 Difference]: With dead ends: 125 [2018-10-27 01:03:13,818 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 01:03:13,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 01:03:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-10-27 01:03:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 01:03:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-10-27 01:03:13,830 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 45 [2018-10-27 01:03:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:13,830 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-10-27 01:03:13,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 01:03:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-10-27 01:03:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 01:03:13,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:13,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:13,832 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:13,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1524962591, now seen corresponding path program 1 times [2018-10-27 01:03:13,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:13,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:13,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 01:03:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 01:03:14,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:14,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:14,029 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2018-10-27 01:03:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:14,391 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-10-27 01:03:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:14,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-10-27 01:03:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:14,394 INFO L225 Difference]: With dead ends: 100 [2018-10-27 01:03:14,394 INFO L226 Difference]: Without dead ends: 73 [2018-10-27 01:03:14,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 01:03:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-27 01:03:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-27 01:03:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-27 01:03:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2018-10-27 01:03:14,402 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 61 [2018-10-27 01:03:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:14,402 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2018-10-27 01:03:14,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-10-27 01:03:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 01:03:14,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:14,406 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:14,406 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:14,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash 880469320, now seen corresponding path program 1 times [2018-10-27 01:03:14,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:14,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:14,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:14,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 01:03:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:14,538 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:14,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:14,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 01:03:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 01:03:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-27 01:03:14,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:14,735 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 6 states. [2018-10-27 01:03:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:14,945 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-27 01:03:14,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:14,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-27 01:03:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:14,947 INFO L225 Difference]: With dead ends: 136 [2018-10-27 01:03:14,947 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 01:03:14,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 01:03:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 01:03:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-10-27 01:03:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 01:03:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 01:03:14,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 65 [2018-10-27 01:03:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:14,957 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 01:03:14,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 01:03:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 01:03:14,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:14,960 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:14,961 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:14,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:14,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1758906760, now seen corresponding path program 2 times [2018-10-27 01:03:14,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:14,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:14,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:14,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:14,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:03:16,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:16,270 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:16,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 01:03:16,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 01:03:16,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:16,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:16,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:16,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:16,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:16,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:16,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:16,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-27 01:03:16,975 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 39 [2018-10-27 01:03:16,986 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 31 treesize of output 30 [2018-10-27 01:03:16,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:17,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 27 [2018-10-27 01:03:17,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:17,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:17,039 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-27 01:03:17,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-27 01:03:17,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-27 01:03:17,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:17,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:17,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:17,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-10-27 01:03:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 01:03:17,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:03:17,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [24] total 39 [2018-10-27 01:03:17,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-27 01:03:17,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-27 01:03:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 01:03:17,625 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 39 states. [2018-10-27 01:03:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:20,127 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2018-10-27 01:03:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 01:03:20,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 81 [2018-10-27 01:03:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:20,129 INFO L225 Difference]: With dead ends: 118 [2018-10-27 01:03:20,129 INFO L226 Difference]: Without dead ends: 93 [2018-10-27 01:03:20,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=341, Invalid=4215, Unknown=0, NotChecked=0, Total=4556 [2018-10-27 01:03:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-27 01:03:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-10-27 01:03:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 01:03:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-27 01:03:20,143 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 81 [2018-10-27 01:03:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:20,143 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 01:03:20,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-27 01:03:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-27 01:03:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-27 01:03:20,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:20,145 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:20,145 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:20,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 535835557, now seen corresponding path program 1 times [2018-10-27 01:03:20,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 01:03:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 01:03:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:20,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:20,543 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 5 [2018-10-27 01:03:20,883 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 01:03:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 01:03:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:23,130 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:23,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:23,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 01:03:23,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-27 01:03:23,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:23,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:23,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-27 01:03:23,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:23,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:23,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:23,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:23,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:23,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-10-27 01:03:25,767 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2018-10-27 01:03:25,774 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:25,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:25,778 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 15 treesize of output 8 [2018-10-27 01:03:25,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:25,912 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 171 [2018-10-27 01:03:25,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-10-27 01:03:25,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:26,274 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:26,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 180 [2018-10-27 01:03:26,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:26,868 INFO L303 Elim1Store]: Index analysis took 216 ms [2018-10-27 01:03:26,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 157 [2018-10-27 01:03:26,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-10-27 01:03:26,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:27,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:27,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 148 [2018-10-27 01:03:27,111 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:27,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:27,384 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:27,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 152 treesize of output 151 [2018-10-27 01:03:27,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:27,403 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:27,461 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:27,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 156 [2018-10-27 01:03:27,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:27,726 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:27,751 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:28,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 151 [2018-10-27 01:03:28,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:28,176 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:28,200 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:28,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:28,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 154 [2018-10-27 01:03:28,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:28,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:28,671 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:28,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 185 [2018-10-27 01:03:28,676 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:28,890 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 158 treesize of output 157 [2018-10-27 01:03:28,891 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:29,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 149 [2018-10-27 01:03:29,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,173 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 165 [2018-10-27 01:03:29,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 179 [2018-10-27 01:03:29,207 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:29,264 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:29,338 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:03:29,617 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 159 treesize of output 136 [2018-10-27 01:03:29,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 169 [2018-10-27 01:03:29,648 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:29,700 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:29,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 148 [2018-10-27 01:03:29,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:29,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 137 [2018-10-27 01:03:30,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:30,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 161 [2018-10-27 01:03:30,030 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:30,082 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:30,123 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:30,228 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:03:30,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 01:03:30,731 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 134 [2018-10-27 01:03:30,735 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 129 treesize of output 128 [2018-10-27 01:03:30,736 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:30,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 131 [2018-10-27 01:03:30,889 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:31,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 121 [2018-10-27 01:03:31,140 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 110 treesize of output 109 [2018-10-27 01:03:31,140 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:31,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:31,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 129 [2018-10-27 01:03:31,264 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:31,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 104 [2018-10-27 01:03:31,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:31,387 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:31,408 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:31,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 99 [2018-10-27 01:03:31,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:31,522 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:31,570 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:31,824 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:31,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 118 [2018-10-27 01:03:32,004 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 109 treesize of output 108 [2018-10-27 01:03:32,004 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:32,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:32,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 121 [2018-10-27 01:03:32,093 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:32,178 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 98 treesize of output 89 [2018-10-27 01:03:32,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,190 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 2 case distinctions, treesize of input 36 treesize of output 60 [2018-10-27 01:03:32,190 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:32,244 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:32,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 105 [2018-10-27 01:03:32,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,591 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:32,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 93 treesize of output 131 [2018-10-27 01:03:32,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:32,605 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:32,628 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:32,684 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:03:32,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 104 [2018-10-27 01:03:32,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:32,849 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 2 case distinctions, treesize of input 89 treesize of output 115 [2018-10-27 01:03:32,850 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:32,920 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:03:33,028 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 01:03:33,269 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 01:03:33,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:33,276 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 156 [2018-10-27 01:03:33,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:33,279 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,305 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 70 [2018-10-27 01:03:33,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:33,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 82 [2018-10-27 01:03:33,309 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,326 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 85 treesize of output 88 [2018-10-27 01:03:33,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:33,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 01:03:33,332 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,345 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,352 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,364 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,382 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 132 [2018-10-27 01:03:33,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:33,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 129 [2018-10-27 01:03:33,388 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,579 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 127 treesize of output 126 [2018-10-27 01:03:33,579 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 116 [2018-10-27 01:03:33,784 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 107 treesize of output 106 [2018-10-27 01:03:33,785 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:33,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:33,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:33,877 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 135 [2018-10-27 01:03:33,878 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 110 [2018-10-27 01:03:34,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:34,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-10-27 01:03:34,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:34,379 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:34,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-10-27 01:03:34,382 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,437 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,482 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:34,562 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 104 treesize of output 99 [2018-10-27 01:03:34,564 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:34,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 01:03:34,566 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,580 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,652 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:34,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 115 [2018-10-27 01:03:34,847 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 104 treesize of output 103 [2018-10-27 01:03:34,848 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:34,924 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:34,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 131 [2018-10-27 01:03:34,925 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,005 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 114 treesize of output 109 [2018-10-27 01:03:35,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 01:03:35,009 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,022 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 102 [2018-10-27 01:03:35,106 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2018-10-27 01:03:35,108 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 126 [2018-10-27 01:03:35,244 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,289 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:35,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 101 [2018-10-27 01:03:35,372 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2018-10-27 01:03:35,374 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:35,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 100 [2018-10-27 01:03:35,430 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,457 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,477 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,501 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,510 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 158 [2018-10-27 01:03:35,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:35,513 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,545 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 72 [2018-10-27 01:03:35,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:35,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 84 [2018-10-27 01:03:35,551 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,572 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 87 treesize of output 90 [2018-10-27 01:03:35,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 01:03:35,582 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:35,599 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:35,624 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:35,656 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:35,902 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 103 treesize of output 100 [2018-10-27 01:03:35,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:35,905 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,922 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,927 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 111 treesize of output 126 [2018-10-27 01:03:35,930 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 26 treesize of output 25 [2018-10-27 01:03:35,930 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,945 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,950 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 125 treesize of output 130 [2018-10-27 01:03:35,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:35,952 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,968 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,972 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 95 treesize of output 106 [2018-10-27 01:03:35,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 01:03:35,975 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,987 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:35,991 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 104 treesize of output 115 [2018-10-27 01:03:35,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 01:03:35,993 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,015 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,019 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 110 treesize of output 115 [2018-10-27 01:03:36,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:36,022 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,036 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,040 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 105 treesize of output 102 [2018-10-27 01:03:36,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:36,043 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,057 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,063 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 109 treesize of output 124 [2018-10-27 01:03:36,071 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 26 treesize of output 25 [2018-10-27 01:03:36,071 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,087 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-27 01:03:36,257 INFO L202 ElimStorePlain]: Needed 96 recursive calls to eliminate 9 variables, input treesize:330, output treesize:824 [2018-10-27 01:03:36,851 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2018-10-27 01:03:36,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 100 [2018-10-27 01:03:36,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:36,886 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-10-27 01:03:36,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:36,900 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:36,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-10-27 01:03:36,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:36,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:37,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 84 [2018-10-27 01:03:37,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-10-27 01:03:37,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-10-27 01:03:37,061 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 72 [2018-10-27 01:03:37,203 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-10-27 01:03:37,204 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 107 [2018-10-27 01:03:37,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2018-10-27 01:03:37,368 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-10-27 01:03:37,381 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,389 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2018-10-27 01:03:37,598 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 31 treesize of output 15 [2018-10-27 01:03:37,599 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,614 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 123 [2018-10-27 01:03:37,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 92 [2018-10-27 01:03:37,742 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2018-10-27 01:03:37,803 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-10-27 01:03:37,884 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-10-27 01:03:37,945 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:37,978 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 86 [2018-10-27 01:03:38,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 6 [2018-10-27 01:03:38,115 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,375 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 44 treesize of output 26 [2018-10-27 01:03:38,375 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,383 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 62 [2018-10-27 01:03:38,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:38,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-27 01:03:38,493 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-10-27 01:03:38,530 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,557 INFO L267 ElimStorePlain]: Start of recursive call 23: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-10-27 01:03:38,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:38,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 01:03:38,638 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,644 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2018-10-27 01:03:38,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-10-27 01:03:38,782 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-27 01:03:38,790 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,794 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 63 [2018-10-27 01:03:38,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:38,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 01:03:38,873 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,881 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-10-27 01:03:38,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 01:03:38,943 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-10-27 01:03:38,957 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:38,967 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2018-10-27 01:03:39,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 01:03:39,049 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:39,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:39,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-10-27 01:03:39,068 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:39,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-10-27 01:03:39,085 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,097 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 01:03:39,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 80 [2018-10-27 01:03:39,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:39,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:39,259 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 71 treesize of output 59 [2018-10-27 01:03:39,259 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:03:39,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-10-27 01:03:39,291 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,322 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-10-27 01:03:39,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-27 01:03:39,399 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-10-27 01:03:39,418 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,432 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 16 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 01:03:39,474 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 26 variables, input treesize:887, output treesize:66 [2018-10-27 01:03:39,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 01:03:39,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:39,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 01:03:39,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-10-27 01:03:39,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 01:03:39,717 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-10-27 01:03:39,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:39,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:03:39,747 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:43, output treesize:18 [2018-10-27 01:03:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 01:03:39,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 01:03:39,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 66 [2018-10-27 01:03:39,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-27 01:03:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-27 01:03:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4035, Unknown=29, NotChecked=0, Total=4290 [2018-10-27 01:03:39,792 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 66 states. [2018-10-27 01:03:44,746 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-10-27 01:03:45,335 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-10-27 01:03:45,657 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2018-10-27 01:03:46,191 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 95 [2018-10-27 01:03:46,619 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 95 [2018-10-27 01:03:46,932 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 97 [2018-10-27 01:03:47,309 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 95 [2018-10-27 01:03:47,851 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2018-10-27 01:03:48,104 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 94 [2018-10-27 01:03:48,490 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 94 [2018-10-27 01:03:48,746 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 96 [2018-10-27 01:03:49,025 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 94 [2018-10-27 01:03:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:49,039 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2018-10-27 01:03:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-27 01:03:49,040 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 83 [2018-10-27 01:03:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:49,041 INFO L225 Difference]: With dead ends: 180 [2018-10-27 01:03:49,041 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 01:03:49,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=641, Invalid=10441, Unknown=48, NotChecked=0, Total=11130 [2018-10-27 01:03:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 01:03:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 01:03:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 01:03:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 01:03:49,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-10-27 01:03:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:49,044 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 01:03:49,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-27 01:03:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 01:03:49,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 01:03:49,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 01:03:49,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:03:49,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 01:03:49,298 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 01:03:49,457 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-27 01:03:49,668 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 26 [2018-10-27 01:03:49,957 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 26 [2018-10-27 01:03:50,105 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-10-27 01:03:50,159 INFO L425 ceAbstractionStarter]: For program point L585-1(line 585) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-10-27 01:03:50,160 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= sll_create_~new_head~0.offset 0) (= 1 (select |#valid| sll_create_~head~0.base)) (not (= 0 sll_create_~new_head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 0 sll_create_~head~0.offset) (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= 0 sll_create_~head~0.base)))) [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-10-27 01:03:50,160 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L421 ceAbstractionStarter]: At program point L575-4(lines 575 579) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= sll_create_~new_head~0.offset 0) (= 1 (select |#valid| sll_create_~head~0.base)) (not (= 0 sll_create_~new_head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 0 sll_create_~head~0.offset) (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= 0 sll_create_~head~0.base)))) [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 573 581) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L601(line 601) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L601-1(lines 598 602) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L425 ceAbstractionStarter]: For program point L595-1(line 595) no Hoare annotation was computed. [2018-10-27 01:03:50,161 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 589 604) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (or (< |sll_insert_#in~head.offset| 4) (= 0 |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L421 ceAbstractionStarter]: At program point L593-3(lines 593 597) the Hoare annotation is: (or (and (or (< |sll_insert_#in~head.offset| 4) (= 0 |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0)) (let ((.cse0 (@diff |old(#valid)| |#valid|))) (and (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (select |old(#valid)| sll_insert_~new_node~0.base) 0) (not (= 0 sll_insert_~new_node~0.base)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0))) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse0))) (<= 0 sll_insert_~new_node~0.offset) (exists ((node_create_~data Int)) (= (store |old(#memory_int)| sll_insert_~new_node~0.base (store (select |old(#memory_int)| sll_insert_~new_node~0.base) 0 node_create_~data)) |#memory_int|)) (= |#valid| (store |old(#valid)| .cse0 (select |#valid| .cse0)))))) [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point L592-1(line 592) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (or (and (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= sll_insert_~index |sll_insert_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (or (< |sll_insert_#in~head.offset| 4) (= 0 |sll_insert_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) 0))) [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:03:50,162 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 01:03:50,162 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L428 ceAbstractionStarter]: At program point L638-1(line 638) the Hoare annotation is: true [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L638-2(line 638) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 621) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (<= main_~data~0 1) (= |main_~#s~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (mod v_prenex_2 2) 0) (<= (div v_prenex_2 2) main_~mid_index~0))) (<= 1 main_~data~0) (<= 2 main_~len~0)) [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-10-27 01:03:50,163 INFO L421 ceAbstractionStarter]: At program point L627-3(lines 627 634) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (<= main_~data~0 1) (= |main_~#s~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (mod v_prenex_2 2) 0) (<= (div v_prenex_2 2) main_~mid_index~0))) (<= 1 main_~data~0) (<= 2 main_~len~0)) [2018-10-27 01:03:50,163 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L615(line 615) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L615-1(line 615) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L421 ceAbstractionStarter]: At program point L611(line 611) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= 1 (select |#valid| .cse0)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) 0) (not (= .cse0 0)) (<= main_~data~0 1) (= |main_~#s~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (mod v_prenex_2 2) 0) (<= (div v_prenex_2 2) main_~mid_index~0))) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (<= 1 main_~data~0) (<= 2 main_~len~0))) [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L421 ceAbstractionStarter]: At program point L636(lines 605 642) the Hoare annotation is: (and (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (<= main_~data~0 1) (= |main_~#s~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (mod v_prenex_2 2) 0) (<= (div v_prenex_2 2) main_~mid_index~0))) (<= 2 main_~len~0) (<= 1 main_~data~0)) [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L628-1(line 628) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L616(line 616) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 616 618) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L425 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,164 INFO L421 ceAbstractionStarter]: At program point L608-1(line 608) the Hoare annotation is: (let ((.cse1 (@diff |old(#valid)| |#valid|))) (and (or (= 0 (select |old(#valid)| |sll_insert_#in~head.base|)) (let ((.cse0 (@diff |old(#memory_int)| |#memory_int|))) (and (= (store |old(#memory_int)| .cse0 (select |#memory_int| .cse0)) |#memory_int|) (or (= 0 (select |old(#valid)| .cse0)) (= |#memory_int| |old(#memory_int)|)) (= (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) (select |old(#memory_$Pointer$.offset)| |sll_insert_#in~head.base|)))) (not (= |sll_insert_#in~head.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|) |sll_insert_#in~head.base|)) (<= main_~data~0 1) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse1))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |main_~#s~0.offset|) (<= 1 main_~data~0) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1) (= |#valid| (store |old(#valid)| .cse1 (select |#valid| .cse1))))) [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-2(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 605 642) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-3(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-4(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-5(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-6(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L608-7(line 608) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L629-1(lines 629 631) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L625-1(line 625) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 564 572) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 01:03:50,165 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point L565-1(line 565) no Hoare annotation was computed. [2018-10-27 01:03:50,166 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-10-27 01:03:50,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,178 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,179 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,180 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,180 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,181 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,181 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,182 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,182 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,182 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,182 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,182 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,183 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,183 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,183 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,183 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,183 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,187 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,187 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,187 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,188 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,188 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,188 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,188 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,189 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,191 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:326) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 01:03:50,194 INFO L168 Benchmark]: Toolchain (without parser) took 38712.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 958.0 MB in the beginning and 958.4 MB in the end (delta: -336.0 kB). Peak memory consumption was 371.9 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:50,194 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:03:50,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 933.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:50,195 INFO L168 Benchmark]: Boogie Preprocessor took 125.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:50,195 INFO L168 Benchmark]: RCFGBuilder took 999.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:50,195 INFO L168 Benchmark]: TraceAbstraction took 37165.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 958.4 MB in the end (delta: 136.2 MB). Peak memory consumption was 354.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:03:50,197 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 933.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -212.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 999.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37165.68 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 958.4 MB in the end (delta: 136.2 MB). Peak memory consumption was 354.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 627]: Loop Invariant [2018-10-27 01:03:50,200 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,201 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,201 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,202 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((!(#memory_$Pointer$[s][s] == 0) && data <= 1) && s == 0) && (\exists v_prenex_2 : int :: (2 <= v_prenex_2 && v_prenex_2 % 2 == 0) && v_prenex_2 / 2 <= mid_index)) && 1 <= data) && 2 <= len - InvariantResult [Line: 614]: Loop Invariant [2018-10-27 01:03:50,202 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,203 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((!(#memory_$Pointer$[s][s] == 0) && data <= 1) && s == 0) && (\exists v_prenex_2 : int :: (2 <= v_prenex_2 && v_prenex_2 % 2 == 0) && v_prenex_2 / 2 <= mid_index)) && 1 <= data) && 2 <= len - InvariantResult [Line: 605]: Loop Invariant [2018-10-27 01:03:50,204 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,205 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,205 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,205 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,205 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,205 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,206 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,206 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-10-27 01:03:50,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((!(#memory_$Pointer$[s][s] == 0) && data <= 1) && s == 0) && (\exists v_prenex_2 : int :: (2 <= v_prenex_2 && v_prenex_2 % 2 == 0) && v_prenex_2 / 2 <= mid_index)) && 2 <= len) && 1 <= data - InvariantResult [Line: 575]: Loop Invariant [2018-10-27 01:03:50,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,206 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,207 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,207 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,208 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,208 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:03:50,209 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,209 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:03:50,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 01:03:50,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((data <= \old(data) && \valid == \old(\valid)) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((((((unknown-#memory_int-unknown[new_head][0] == \old(data) && new_head == 0) && 1 == \valid[head]) && !(0 == new_head)) && \old(data) == data) && \old(data) == unknown-#memory_int-unknown[head][0]) && 0 == head) && 1 == \valid[new_head]) && !(0 == head)) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-27 01:03:51,922 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:03:51,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:03:51,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:03:51,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:03:51,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:03:51,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:03:51,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:03:51,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:03:51,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:03:51,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:03:51,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:03:51,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:03:51,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:03:51,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:03:51,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:03:51,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:03:51,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:03:51,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:03:51,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:03:51,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:03:51,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:03:51,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:03:51,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:03:51,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:03:51,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:03:51,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:03:51,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:03:51,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:03:51,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:03:51,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:03:51,956 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:03:51,956 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:03:51,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:03:51,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:03:51,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:03:51,959 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-10-27 01:03:51,970 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:03:51,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:03:51,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:03:51,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 01:03:51,972 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 01:03:51,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 01:03:51,972 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 01:03:51,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:03:51,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:03:51,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-27 01:03:51,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:03:51,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:03:51,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:03:51,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:03:51,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 01:03:51,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:03:51,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 01:03:51,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:51,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:03:51,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:03:51,977 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:03:51,977 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-27 01:03:51,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:03:51,977 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-27 01:03:51,977 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-27 01:03:51,977 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_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-10-27 01:03:52,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:03:52,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:03:52,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:03:52,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:03:52,036 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:03:52,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:52,086 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/a340d6c06/6add6b8fac944c6cb2ee8d3622a58dde/FLAG2ed2cbd23 [2018-10-27 01:03:52,506 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:03:52,506 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:52,516 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/a340d6c06/6add6b8fac944c6cb2ee8d3622a58dde/FLAG2ed2cbd23 [2018-10-27 01:03:52,529 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/data/a340d6c06/6add6b8fac944c6cb2ee8d3622a58dde [2018-10-27 01:03:52,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:03:52,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 01:03:52,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:52,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:03:52,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:03:52,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:52,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d78aa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52, skipping insertion in model container [2018-10-27 01:03:52,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:52,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:03:52,588 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:03:52,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:52,870 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:03:52,913 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:52,956 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:03:52,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52 WrapperNode [2018-10-27 01:03:52,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:52,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:03:52,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:03:52,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:03:52,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:52,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:52,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:52,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:53,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:53,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:53,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... [2018-10-27 01:03:53,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:03:53,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:03:53,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:03:53,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:03:53,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:03:53,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-27 01:03:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-27 01:03:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-27 01:03:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 01:03:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 01:03:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 01:03:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 01:03:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 01:03:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 01:03:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 01:03:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 01:03:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 01:03:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 01:03:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 01:03:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 01:03:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 01:03:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 01:03:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 01:03:53,182 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 01:03:53,183 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 01:03:53,184 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 01:03:53,185 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 01:03:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 01:03:53,186 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 01:03:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-10-27 01:03:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:03:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-10-27 01:03:53,926 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:03:53,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:53 BoogieIcfgContainer [2018-10-27 01:03:53,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:03:53,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 01:03:53,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 01:03:53,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 01:03:53,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 01:03:52" (1/3) ... [2018-10-27 01:03:53,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e188df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:53, skipping insertion in model container [2018-10-27 01:03:53,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:52" (2/3) ... [2018-10-27 01:03:53,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e188df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:53, skipping insertion in model container [2018-10-27 01:03:53,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:53" (3/3) ... [2018-10-27 01:03:53,935 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-27 01:03:53,943 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 01:03:53,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 01:03:53,966 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 01:03:53,993 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 01:03:53,994 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 01:03:53,994 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 01:03:53,994 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 01:03:53,994 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 01:03:53,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 01:03:53,995 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 01:03:53,995 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 01:03:53,995 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 01:03:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-10-27 01:03:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 01:03:54,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:54,020 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:54,023 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:54,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash -960913746, now seen corresponding path program 1 times [2018-10-27 01:03:54,033 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:03:54,034 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:03:54,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:54,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:54,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-10-27 01:03:54,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:54,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 01:03:54,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 01:03:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 01:03:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 01:03:54,208 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-10-27 01:03:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:54,232 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2018-10-27 01:03:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 01:03:54,233 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-10-27 01:03:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:54,242 INFO L225 Difference]: With dead ends: 162 [2018-10-27 01:03:54,243 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 01:03:54,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 01:03:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 01:03:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-27 01:03:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 01:03:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-10-27 01:03:54,287 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 42 [2018-10-27 01:03:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:54,288 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-27 01:03:54,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 01:03:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-10-27 01:03:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 01:03:54,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:54,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:54,291 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:54,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1636984481, now seen corresponding path program 1 times [2018-10-27 01:03:54,293 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:03:54,293 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:03:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:54,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:54,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 01:03:54,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 01:03:54,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 01:03:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 01:03:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 01:03:54,652 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2018-10-27 01:03:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:54,995 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-10-27 01:03:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 01:03:54,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-27 01:03:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:54,998 INFO L225 Difference]: With dead ends: 125 [2018-10-27 01:03:54,998 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 01:03:54,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 01:03:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-10-27 01:03:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 01:03:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-10-27 01:03:55,011 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 45 [2018-10-27 01:03:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:55,011 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-10-27 01:03:55,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 01:03:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-10-27 01:03:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-27 01:03:55,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:55,013 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:55,014 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1524962591, now seen corresponding path program 1 times [2018-10-27 01:03:55,015 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:03:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:03:55,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:55,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:55,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 01:03:55,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 01:03:55,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-27 01:03:55,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 01:03:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 01:03:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-27 01:03:55,794 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 9 states. [2018-10-27 01:03:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:56,062 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-10-27 01:03:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 01:03:56,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-27 01:03:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:56,064 INFO L225 Difference]: With dead ends: 132 [2018-10-27 01:03:56,064 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 01:03:56,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 01:03:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 01:03:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-10-27 01:03:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 01:03:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-10-27 01:03:56,073 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 61 [2018-10-27 01:03:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:56,074 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-10-27 01:03:56,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 01:03:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-10-27 01:03:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 01:03:56,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:56,076 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:56,077 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:56,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1718423775, now seen corresponding path program 2 times [2018-10-27 01:03:56,077 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:03:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:03:56,092 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-27 01:03:56,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 01:03:56,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:56,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 01:03:56,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 01:03:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 01:03:56,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:56,348 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2018-10-27 01:03:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:56,492 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-10-27 01:03:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:56,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-10-27 01:03:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:56,494 INFO L225 Difference]: With dead ends: 107 [2018-10-27 01:03:56,494 INFO L226 Difference]: Without dead ends: 80 [2018-10-27 01:03:56,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-27 01:03:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-27 01:03:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-27 01:03:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 01:03:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 01:03:56,506 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 77 [2018-10-27 01:03:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:56,506 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 01:03:56,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 01:03:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 01:03:56,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:56,507 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:56,507 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:56,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1758906760, now seen corresponding path program 1 times [2018-10-27 01:03:56,508 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:03:56,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:03:56,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:56,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:56,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 01:03:56,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:56,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:56,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 01:03:56,748 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-10-27 01:03:57,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:57,085 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:03:57,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 01:03:57,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-27 01:03:57,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:57,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:57,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:57,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2018-10-27 01:03:57,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:03:57,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:03:57,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:03:57,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:03:57,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:03:57,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-10-27 01:03:57,506 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-10-27 01:03:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 27 not checked. [2018-10-27 01:03:58,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:58,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:58,318 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:58,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:58,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:04:00,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:04:00,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:04:00,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-27 01:04:00,473 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 37 [2018-10-27 01:04:00,499 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 29 treesize of output 28 [2018-10-27 01:04:00,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2018-10-27 01:04:00,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:00,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:04:00,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:04:00,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 01:04:00,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-27 01:04:00,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-27 01:04:00,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:00,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-10-27 01:04:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 01:04:01,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:04:01,584 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-10-27 01:04:01,616 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 9 treesize of output 8 [2018-10-27 01:04:01,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:01,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-27 01:04:01,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 01:04:01,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:01,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:01,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:01,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:01,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2018-10-27 01:04:02,120 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-27 01:04:02,159 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 9 treesize of output 8 [2018-10-27 01:04:02,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-10-27 01:04:02,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-27 01:04:02,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 01:04:02,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-10-27 01:04:02,272 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:02,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:04:02,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-10-27 01:04:02,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 01:04:02,312 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-10-27 01:04:02,340 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:02,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 01:04:02,363 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,379 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:04:02,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-27 01:04:02,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 01:04:02,385 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,403 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-10-27 01:04:02,576 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-27 01:04:02,610 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 9 treesize of output 8 [2018-10-27 01:04:02,611 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-10-27 01:04:02,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-27 01:04:02,655 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-10-27 01:04:02,683 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:02,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-10-27 01:04:02,703 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,719 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:04:02,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-10-27 01:04:02,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-10-27 01:04:02,737 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-27 01:04:02,761 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,791 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 1 case distinctions, treesize of input 18 treesize of output 14 [2018-10-27 01:04:02,792 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:02,810 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 01:04:02,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-27 01:04:02,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-27 01:04:02,817 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,825 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:02,876 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-10-27 01:04:03,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 15 xjuncts. [2018-10-27 01:04:03,010 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:81, output treesize:169 [2018-10-27 01:04:03,306 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-10-27 01:04:04,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 01:04:06,746 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-27 01:04:08,076 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 01:04:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 01:04:13,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:04:13,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 62 [2018-10-27 01:04:13,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-27 01:04:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-27 01:04:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3305, Unknown=171, NotChecked=238, Total=3906 [2018-10-27 01:04:13,247 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 62 states. [2018-10-27 01:04:27,774 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-27 01:04:28,950 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-10-27 01:04:30,215 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-10-27 01:04:30,995 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-10-27 01:04:32,166 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-10-27 01:04:32,679 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-27 01:04:33,966 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-10-27 01:04:34,748 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-10-27 01:04:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:04:37,509 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2018-10-27 01:04:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 01:04:37,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 81 [2018-10-27 01:04:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:04:37,512 INFO L225 Difference]: With dead ends: 183 [2018-10-27 01:04:37,512 INFO L226 Difference]: Without dead ends: 119 [2018-10-27 01:04:37,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=643, Invalid=9551, Unknown=320, NotChecked=406, Total=10920 [2018-10-27 01:04:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-27 01:04:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-10-27 01:04:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-27 01:04:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-10-27 01:04:37,536 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 81 [2018-10-27 01:04:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:04:37,536 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-10-27 01:04:37,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-27 01:04:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-10-27 01:04:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 01:04:37,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:04:37,537 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:04:37,537 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:04:37,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:04:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1827421912, now seen corresponding path program 1 times [2018-10-27 01:04:37,542 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 01:04:37,542 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 01:04:37,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:04:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:04:37,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:04:37,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 01:04:37,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:37,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:37,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 01:04:37,727 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-10-27 01:04:38,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:38,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:38,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:38,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-10-27 01:04:38,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-10-27 01:04:38,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:38,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:38,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:38,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:41 [2018-10-27 01:04:38,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:04:38,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:04:38,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:38,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:38,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:38,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:57 [2018-10-27 01:04:39,094 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-10-27 01:04:39,630 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-10-27 01:04:39,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:39,662 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:39,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:04:39,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-27 01:04:39,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:39,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2018-10-27 01:04:39,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 01:04:39,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:39,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-10-27 01:04:39,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-27 01:04:39,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:40,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2018-10-27 01:04:40,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-10-27 01:04:40,098 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 01:04:40,153 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:04:40,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:04:40,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:04:40,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 01:04:40,393 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:193, output treesize:134 [2018-10-27 01:04:40,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2018-10-27 01:04:40,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-10-27 01:04:40,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:40,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-27 01:04:40,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:40,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:40,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:40,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:10 [2018-10-27 01:04:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 23 not checked. [2018-10-27 01:04:40,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:04:41,248 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 01:04:41,529 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-27 01:04:41,727 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 01:04:49,004 WARN L179 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 01:04:49,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:04:49,006 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:04:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:04:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:04:49,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:04:49,474 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 6 treesize of output 5 [2018-10-27 01:04:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:49,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:49,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-10-27 01:04:50,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:04:50,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:04:50,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:50,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:50,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 01:04:50,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 01:04:50,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:50,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:50,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:50,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-10-27 01:04:56,183 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2018-10-27 01:04:56,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:56,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:56,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-27 01:04:56,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:56,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-10-27 01:04:56,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-10-27 01:04:56,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:56,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:56,418 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 77 [2018-10-27 01:04:56,427 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 76 treesize of output 75 [2018-10-27 01:04:56,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:57,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:57,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-10-27 01:04:57,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:58,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 64 [2018-10-27 01:04:58,266 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 60 treesize of output 59 [2018-10-27 01:04:58,266 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:58,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:58,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:58,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:04:58,644 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:58,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 67 [2018-10-27 01:04:58,649 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:58,675 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:58,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:59,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2018-10-27 01:04:59,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-10-27 01:04:59,119 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:59,439 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:59,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:59,607 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 52 treesize of output 51 [2018-10-27 01:04:59,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:04:59,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 01:04:59,614 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 01:04:59,629 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:04:59,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:04:59,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 59 [2018-10-27 01:04:59,834 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 01:04:59,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 41 treesize of output 53 [2018-10-27 01:04:59,843 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:59,875 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 01:04:59,968 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 01:05:00,138 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-27 01:05:00,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 63 [2018-10-27 01:05:00,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-10-27 01:05:00,795 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:01,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:05:01,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:05:01,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 57 [2018-10-27 01:05:01,463 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:01,753 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:05:01,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 63 [2018-10-27 01:05:01,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-10-27 01:05:01,798 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:01,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-10-27 01:05:01,901 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:01,928 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:05:02,041 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 43 treesize of output 42 [2018-10-27 01:05:02,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-10-27 01:05:02,045 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,057 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,109 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,208 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 01:05:02,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 01:05:02,249 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 5 variables, input treesize:176, output treesize:83 [2018-10-27 01:05:02,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 01:05:02,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-10-27 01:05:02,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2018-10-27 01:05:02,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-27 01:05:02,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 01:05:02,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-10-27 01:05:02,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-10-27 01:05:02,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:02,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-10-27 01:05:02,997 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 01:05:03,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 01:05:03,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 01:05:03,012 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:82, output treesize:16 [2018-10-27 01:05:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 01:05:03,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:05:04,067 WARN L179 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-10-27 01:05:04,234 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 01:05:04,537 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-27 01:05:04,812 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 01:05:07,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 01:05:07,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2018-10-27 01:05:07,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-27 01:05:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-27 01:05:07,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4205, Unknown=169, NotChecked=266, Total=4830 [2018-10-27 01:05:07,754 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 65 states. [2018-10-27 01:05:10,378 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-10-27 01:05:13,257 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-10-27 01:05:13,752 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-10-27 01:05:14,375 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-27 01:05:18,146 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 01:05:20,645 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 01:05:25,508 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-27 01:05:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:05:30,959 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-10-27 01:05:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 01:05:30,960 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 81 [2018-10-27 01:05:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:05:30,961 INFO L225 Difference]: With dead ends: 144 [2018-10-27 01:05:30,961 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 01:05:30,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=425, Invalid=8987, Unknown=298, NotChecked=390, Total=10100 [2018-10-27 01:05:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 01:05:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 01:05:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 01:05:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 01:05:30,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-10-27 01:05:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:05:30,964 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 01:05:30,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-27 01:05:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 01:05:30,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 01:05:30,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 01:05:31,568 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-10-27 01:05:32,023 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2018-10-27 01:05:32,200 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point L585-1(line 585) no Hoare annotation was computed. [2018-10-27 01:05:32,202 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-10-27 01:05:32,203 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (bvadd |sll_create_#in~len| (_ bv4294967295 32)))) (or (not (bvsgt .cse0 (_ bv0 32))) (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))) (= .cse0 sll_create_~len) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (not (= (_ bv0 32) sll_create_~new_head~0.base)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))))) [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-27 01:05:32,203 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L421 ceAbstractionStarter]: At program point L575-4(lines 575 579) the Hoare annotation is: (let ((.cse4 (bvadd |sll_create_#in~len| (_ bv4294967294 32))) (.cse0 (not (= sll_create_~head~0.base (_ bv0 32)))) (.cse5 (bvadd |sll_create_#in~len| (_ bv4294967295 32))) (.cse2 (not (= (_ bv0 32) sll_create_~new_head~0.base))) (.cse3 (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse0 (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (let ((.cse1 (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 sll_create_~head~0.base)) (= (store .cse1 sll_create_~head~0.base (_ bv1 1)) |#valid|)))) .cse2 (= (_ bv0 32) sll_create_~head~0.offset) .cse3 (= .cse4 sll_create_~len)) (not (bvsgt .cse5 (_ bv0 32))) (bvsgt .cse4 (_ bv0 32)) (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) .cse0 (= .cse5 sll_create_~len) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) .cse2 .cse3))) [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 573 581) the Hoare annotation is: (or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)) (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point L601(line 601) no Hoare annotation was computed. [2018-10-27 01:05:32,204 INFO L425 ceAbstractionStarter]: For program point L601-1(lines 598 602) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L595-1(line 595) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 589 604) the Hoare annotation is: (or (let ((.cse0 (not (bvsgt |sll_insert_#in~index| (_ bv0 32))))) (and (or (= (_ bv0 32) (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) .cse0) (or (= (_ bv0 32) |sll_insert_#in~head.base|) (not (= (_ bv4 32) |sll_insert_#in~head.offset|)) .cse0))) (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L421 ceAbstractionStarter]: At program point L593-3(lines 593 597) the Hoare annotation is: (or (and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|)) (= sll_insert_~new_node~0.offset (_ bv0 32)) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (_ bv0 1) (select |old(#valid)| sll_insert_~new_node~0.base)) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (not (= (_ bv0 32) sll_insert_~new_node~0.base))) (let ((.cse0 (not (bvsgt |sll_insert_#in~index| (_ bv0 32))))) (and (or (= (_ bv0 32) (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) .cse0) (or (= (_ bv0 32) |sll_insert_#in~head.base|) (not (= (_ bv4 32) |sll_insert_#in~head.offset|)) .cse0)))) [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L592-1(line 592) no Hoare annotation was computed. [2018-10-27 01:05:32,205 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (or (let ((.cse0 (not (bvsgt |sll_insert_#in~index| (_ bv0 32))))) (and (or (= (_ bv0 32) (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) .cse0) (or (= (_ bv0 32) |sll_insert_#in~head.base|) (not (= (_ bv4 32) |sll_insert_#in~head.offset|)) .cse0))) (and (= |#valid| |old(#valid)|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_insert_~index |sll_insert_#in~index|) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-10-27 01:05:32,205 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-27 01:05:32,206 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-10-27 01:05:32,206 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:05:32,206 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 01:05:32,214 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:05:32,214 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:05:32,214 INFO L425 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-10-27 01:05:32,214 INFO L428 ceAbstractionStarter]: At program point L638-1(line 638) the Hoare annotation is: true [2018-10-27 01:05:32,215 INFO L425 ceAbstractionStarter]: For program point L638-2(line 638) no Hoare annotation was computed. [2018-10-27 01:05:32,215 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:05:32,215 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-10-27 01:05:32,215 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-10-27 01:05:32,215 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 621) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L421 ceAbstractionStarter]: At program point L627-3(lines 627 634) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L615(line 615) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L615-1(line 615) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L421 ceAbstractionStarter]: At program point L611(line 611) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.base| .cse0)) (not (= (_ bv0 32) .cse0)) (= (_ bv1 1) (select |#valid| .cse0)))) [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-10-27 01:05:32,216 INFO L421 ceAbstractionStarter]: At program point L636(lines 605 642) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L628-1(line 628) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L616(line 616) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 616 618) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L421 ceAbstractionStarter]: At program point L608-1(line 608) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L608-2(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 605 642) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L608-3(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L608-4(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,217 INFO L425 ceAbstractionStarter]: For program point L608-5(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L608-6(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L608-7(line 608) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L629-1(lines 629 631) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L625-1(line 625) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 564 572) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-10-27 01:05:32,218 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 01:05:32,219 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-10-27 01:05:32,219 INFO L425 ceAbstractionStarter]: For program point L565-1(line 565) no Hoare annotation was computed. [2018-10-27 01:05:32,219 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-10-27 01:05:32,248 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,253 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,254 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,261 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,261 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,273 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,273 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-27 01:05:32,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-27 01:05:32,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,277 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,277 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:05:32 BoogieIcfgContainer [2018-10-27 01:05:32,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:05:32,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:05:32,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:05:32,285 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:05:32,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:53" (3/4) ... [2018-10-27 01:05:32,293 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 01:05:32,300 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-10-27 01:05:32,307 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-10-27 01:05:32,307 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-10-27 01:05:32,307 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 01:05:32,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((((!(head == 0bv32) && (\exists node_create_#t~malloc2.base : bv32 :: (\old(\valid)[node_create_#t~malloc2.base] == 0bv1 && 0bv1 == \old(\valid)[node_create_#t~malloc2.base := 1bv1][head]) && \old(\valid)[node_create_#t~malloc2.base := 1bv1][head := 1bv1] == \valid)) && !(0bv32 == new_head)) && 0bv32 == head) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1][new_head := 1bv1])) && ~bvadd64(\old(len), 4294967294bv32) == len)) || !~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 0bv32)) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32)) || ((((((\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \old(\valid)[node_create_#t~malloc2.base := 1bv1][head := 1bv1] == \valid) && !(head == 0bv32)) && ~bvadd64(\old(len), 4294967295bv32) == len) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1])) && !(0bv32 == new_head)) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1][new_head := 1bv1])) [2018-10-27 01:05:32,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && 0bv1 == \old(\valid)[new_node]) && head == head) && !(0bv32 == new_node)) || ((0bv32 == \old(#memory_$Pointer$)[head][head] || !~bvsgt32(\old(index), 0bv32)) && ((0bv32 == head || !(4bv32 == head)) || !~bvsgt32(\old(index), 0bv32))) [2018-10-27 01:05:32,351 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bb5061c1-5f2f-46de-8cce-28f0cbca13a4/bin-2019/uautomizer/witness.graphml [2018-10-27 01:05:32,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:05:32,354 INFO L168 Benchmark]: Toolchain (without parser) took 99821.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 949.2 MB in the beginning and 1.3 GB in the end (delta: -376.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:05:32,355 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:05:32,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 922.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 01:05:32,355 INFO L168 Benchmark]: Boogie Preprocessor took 93.16 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 01:05:32,355 INFO L168 Benchmark]: RCFGBuilder took 875.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-10-27 01:05:32,355 INFO L168 Benchmark]: TraceAbstraction took 98357.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -232.5 MB). Peak memory consumption was 450.6 MB. Max. memory is 11.5 GB. [2018-10-27 01:05:32,356 INFO L168 Benchmark]: Witness Printer took 68.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-10-27 01:05:32,357 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 922.4 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.16 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 875.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98357.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -232.5 MB). Peak memory consumption was 450.6 MB. Max. memory is 11.5 GB. * Witness Printer took 68.64 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 575]: Loop Invariant [2018-10-27 01:05:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,362 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-10-27 01:05:32,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((((!(head == 0bv32) && (\exists node_create_#t~malloc2.base : bv32 :: (\old(\valid)[node_create_#t~malloc2.base] == 0bv1 && 0bv1 == \old(\valid)[node_create_#t~malloc2.base := 1bv1][head]) && \old(\valid)[node_create_#t~malloc2.base := 1bv1][head := 1bv1] == \valid)) && !(0bv32 == new_head)) && 0bv32 == head) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1][new_head := 1bv1])) && ~bvadd64(\old(len), 4294967294bv32) == len)) || !~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 0bv32)) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32)) || ((((((\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \old(\valid)[node_create_#t~malloc2.base := 1bv1][head := 1bv1] == \valid) && !(head == 0bv32)) && ~bvadd64(\old(len), 4294967295bv32) == len) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1])) && !(0bv32 == new_head)) && (\exists node_create_#t~malloc2.base : bv32 :: \old(\valid)[node_create_#t~malloc2.base] == 0bv1 && \valid == \old(\valid)[node_create_#t~malloc2.base := 1bv1][new_head := 1bv1])) - InvariantResult [Line: 593]: Loop Invariant [2018-10-27 01:05:32,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-27 01:05:32,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,385 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-27 01:05:32,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-27 01:05:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-27 01:05:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && 0bv1 == \old(\valid)[new_node]) && head == head) && !(0bv32 == new_node)) || ((0bv32 == \old(#memory_$Pointer$)[head][head] || !~bvsgt32(\old(index), 0bv32)) && ((0bv32 == head || !(4bv32 == head)) || !~bvsgt32(\old(index), 0bv32))) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 98 locations, 1 error locations. SAFE Result, 98.2s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 423 SDtfs, 769 SDslu, 4273 SDs, 0 SdLazy, 4594 SolverSat, 164 SolverUnsat, 540 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 564 SyntacticMatches, 3 SemanticMatches, 221 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3492 ImplicationChecksByTransitivity, 58.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, 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, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 50 PreInvPairs, 70 NumberOfFragments, 546 HoareAnnotationTreeSize, 50 FomulaSimplifications, 1316 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 325 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 549 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 681 ConstructedInterpolants, 93 QuantifiedInterpolants, 554549 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1428 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 143/260 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...