./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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:02,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:43:02,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:43:02,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:43:02,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:43:02,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:43:02,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:43:02,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:43:02,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:43:02,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:43:02,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:43:02,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:43:02,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:43:02,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:43:02,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:43:02,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:43:02,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:43:02,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:43:02,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:43:02,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:43:02,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:43:02,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:43:02,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:43:02,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:43:02,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:43:02,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:43:02,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:43:02,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:43:02,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:43:02,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:43:02,843 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:43:02,843 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:43:02,843 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:43:02,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:43:02,844 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:43:02,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:43:02,845 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 22:43:02,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:43:02,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:43:02,855 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 22:43:02,855 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 22:43:02,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:43:02,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:43:02,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 22:43:02,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:43:02,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:43:02,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 22:43:02,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 22:43:02,859 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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:02,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:43:02,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:43:02,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:43:02,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:43:02,898 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:43:02,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:02,944 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/e262427b8/8f73e16a335248178b9eaeda7219b1ec/FLAG32ead8496 [2018-11-09 22:43:03,379 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:43:03,380 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:03,386 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/e262427b8/8f73e16a335248178b9eaeda7219b1ec/FLAG32ead8496 [2018-11-09 22:43:03,395 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/e262427b8/8f73e16a335248178b9eaeda7219b1ec [2018-11-09 22:43:03,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:43:03,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 22:43:03,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:43:03,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:43:03,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:43:03,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4440e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03, skipping insertion in model container [2018-11-09 22:43:03,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:43:03,436 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:43:03,631 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:43:03,639 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:43:03,673 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:43:03,698 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:43:03,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03 WrapperNode [2018-11-09 22:43:03,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:43:03,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:43:03,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:43:03,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:43:03,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... [2018-11-09 22:43:03,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:43:03,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:43:03,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:43:03,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:43:03,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:43:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-09 22:43:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-09 22:43:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-09 22:43:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-09 22:43:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-09 22:43:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-09 22:43:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-09 22:43:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-09 22:43:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-09 22:43:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-09 22:43:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-09 22:43:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-09 22:43:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 22:43:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:43:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 22:43:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:43:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-09 22:43:04,211 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:43:04,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:43:04 BoogieIcfgContainer [2018-11-09 22:43:04,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:43:04,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 22:43:04,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 22:43:04,215 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 22:43:04,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:43:03" (1/3) ... [2018-11-09 22:43:04,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6814c338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:43:04, skipping insertion in model container [2018-11-09 22:43:04,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:03" (2/3) ... [2018-11-09 22:43:04,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6814c338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:43:04, skipping insertion in model container [2018-11-09 22:43:04,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:43:04" (3/3) ... [2018-11-09 22:43:04,218 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:04,226 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 22:43:04,233 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 22:43:04,246 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 22:43:04,271 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:43:04,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 22:43:04,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 22:43:04,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 22:43:04,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:43:04,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:43:04,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 22:43:04,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:43:04,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 22:43:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-11-09 22:43:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-09 22:43:04,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:04,295 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-11-09 22:43:04,297 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:04,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -960913746, now seen corresponding path program 1 times [2018-11-09 22:43:04,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:04,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:43:04,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:04,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 22:43:04,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-09 22:43:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 22:43:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 22:43:04,453 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-11-09 22:43:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:04,477 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2018-11-09 22:43:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 22:43:04,478 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-11-09 22:43:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:04,486 INFO L225 Difference]: With dead ends: 162 [2018-11-09 22:43:04,486 INFO L226 Difference]: Without dead ends: 67 [2018-11-09 22:43:04,488 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-11-09 22:43:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-09 22:43:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-09 22:43:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-09 22:43:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-09 22:43:04,515 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 42 [2018-11-09 22:43:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:04,515 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-09 22:43:04,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-09 22:43:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-09 22:43:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-09 22:43:04,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:04,517 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-11-09 22:43:04,517 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:04,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1636984481, now seen corresponding path program 1 times [2018-11-09 22:43:04,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:04,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:43:04,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:04,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 22:43:04,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 22:43:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 22:43:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 22:43:04,600 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2018-11-09 22:43:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:04,660 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-11-09 22:43:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 22:43:04,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-09 22:43:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:04,663 INFO L225 Difference]: With dead ends: 125 [2018-11-09 22:43:04,663 INFO L226 Difference]: Without dead ends: 74 [2018-11-09 22:43:04,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:43:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-09 22:43:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-09 22:43:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-09 22:43:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-11-09 22:43:04,673 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 45 [2018-11-09 22:43:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:04,673 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-11-09 22:43:04,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 22:43:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-09 22:43:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-09 22:43:04,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:04,675 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-11-09 22:43:04,675 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:04,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1524962591, now seen corresponding path program 1 times [2018-11-09 22:43:04,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:04,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-09 22:43:04,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:04,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-09 22:43:04,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 22:43:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 22:43:04,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:43:04,765 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2018-11-09 22:43:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:04,829 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-09 22:43:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 22:43:04,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-09 22:43:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:04,831 INFO L225 Difference]: With dead ends: 100 [2018-11-09 22:43:04,831 INFO L226 Difference]: Without dead ends: 73 [2018-11-09 22:43:04,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-09 22:43:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-09 22:43:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-09 22:43:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-09 22:43:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2018-11-09 22:43:04,839 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 61 [2018-11-09 22:43:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:04,840 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2018-11-09 22:43:04,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 22:43:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-11-09 22:43:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-09 22:43:04,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:04,841 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-11-09 22:43:04,841 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:04,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash 880469320, now seen corresponding path program 1 times [2018-11-09 22:43:04,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:04,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:04,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-09 22:43:04,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:43:04,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:43:04,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:04,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-09 22:43:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:43:05,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-09 22:43:05,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 22:43:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 22:43:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:43:05,046 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 6 states. [2018-11-09 22:43:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:05,094 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-11-09 22:43:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 22:43:05,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-09 22:43:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:05,096 INFO L225 Difference]: With dead ends: 136 [2018-11-09 22:43:05,096 INFO L226 Difference]: Without dead ends: 83 [2018-11-09 22:43:05,097 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-11-09 22:43:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-09 22:43:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2018-11-09 22:43:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-09 22:43:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-09 22:43:05,104 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 65 [2018-11-09 22:43:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:05,104 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-09 22:43:05,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 22:43:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-09 22:43:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 22:43:05,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:05,106 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-11-09 22:43:05,106 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1758906760, now seen corresponding path program 2 times [2018-11-09 22:43:05,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:05,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:05,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-09 22:43:05,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:43:05,743 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:43:05,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 22:43:05,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 22:43:05,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 22:43:05,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:06,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:06,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:06,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-09 22:43:06,053 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-11-09 22:43:06,056 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-11-09 22:43:06,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,077 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-11-09 22:43:06,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:06,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:06,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:06,096 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-11-09 22:43:06,185 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-11-09 22:43:06,188 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-11-09 22:43:06,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:06,195 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-11-09 22:43:06,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-11-09 22:43:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-09 22:43:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-09 22:43:06,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [24] total 39 [2018-11-09 22:43:06,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-09 22:43:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-09 22:43:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482 [2018-11-09 22:43:06,324 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 39 states. [2018-11-09 22:43:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:07,899 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2018-11-09 22:43:07,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-09 22:43:07,899 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 81 [2018-11-09 22:43:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:07,900 INFO L225 Difference]: With dead ends: 118 [2018-11-09 22:43:07,900 INFO L226 Difference]: Without dead ends: 93 [2018-11-09 22:43:07,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=341, Invalid=4215, Unknown=0, NotChecked=0, Total=4556 [2018-11-09 22:43:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-09 22:43:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-11-09 22:43:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-09 22:43:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-11-09 22:43:07,910 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 81 [2018-11-09 22:43:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:07,911 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-11-09 22:43:07,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-09 22:43:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-09 22:43:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-09 22:43:07,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:07,913 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-11-09 22:43:07,913 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:07,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash 535835557, now seen corresponding path program 1 times [2018-11-09 22:43:07,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:43:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:43:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:07,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:43:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:43:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-09 22:43:09,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:43:09,678 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:43:09,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:09,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:09,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 22:43:09,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:09,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:09,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-09 22:43:09,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:09,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:09,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:09,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:09,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-09 22:43:10,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:10,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:10,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:10,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:10,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:10,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:10,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:10,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:10,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:10,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-11-09 22:43:11,802 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2018-11-09 22:43:11,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:11,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:11,812 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-11-09 22:43:11,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:11,918 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-11-09 22:43:11,923 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-11-09 22:43:11,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:12,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:12,260 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-11-09 22:43:12,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:12,616 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-11-09 22:43:12,622 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-11-09 22:43:12,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:12,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:12,808 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-11-09 22:43:12,811 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:12,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:13,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:13,023 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-11-09 22:43:13,033 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-11-09 22:43:13,034 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,060 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,283 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-11-09 22:43:13,293 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-11-09 22:43:13,294 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,320 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,620 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-11-09 22:43:13,642 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-11-09 22:43:13,642 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,677 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:13,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:14,104 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-11-09 22:43:14,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,113 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:14,118 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-11-09 22:43:14,118 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:14,298 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-11-09 22:43:14,298 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:14,529 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-11-09 22:43:14,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,540 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:14,546 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-11-09 22:43:14,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,568 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-11-09 22:43:14,569 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:14,622 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:14,696 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:14,970 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-11-09 22:43:14,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:14,993 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-11-09 22:43:14,993 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:15,038 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:15,273 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-11-09 22:43:15,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:15,280 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-11-09 22:43:15,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:15,301 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-11-09 22:43:15,302 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:15,352 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:15,394 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:15,491 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:15,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 22:43:16,037 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-11-09 22:43:16,042 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-11-09 22:43:16,042 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:16,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:16,221 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-11-09 22:43:16,221 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:16,433 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-11-09 22:43:16,436 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-11-09 22:43:16,437 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:16,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:16,513 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-11-09 22:43:16,514 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:16,593 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-11-09 22:43:16,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-09 22:43:16,601 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:16,619 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:16,719 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-11-09 22:43:16,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-11-09 22:43:16,727 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:16,751 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:16,855 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,030 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-11-09 22:43:17,033 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-11-09 22:43:17,033 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:17,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,115 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:17,117 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 137 [2018-11-09 22:43:17,118 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:17,194 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 106 treesize of output 101 [2018-11-09 22:43:17,202 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-11-09 22:43:17,202 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,224 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,343 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-11-09 22:43:17,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:17,369 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-11-09 22:43:17,377 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-11-09 22:43:17,378 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,401 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,451 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:17,612 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-11-09 22:43:17,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,626 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-11-09 22:43:17,627 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:17,693 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:17,795 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-09 22:43:17,940 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 22:43:17,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,947 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-11-09 22:43:17,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:17,949 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:17,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 70 [2018-11-09 22:43:17,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:17,976 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-11-09 22:43:17,976 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:17,992 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-11-09 22:43:17,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:17,996 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-11-09 22:43:17,996 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,005 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,011 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,022 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,039 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-11-09 22:43:18,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,044 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-11-09 22:43:18,044 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,227 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-11-09 22:43:18,227 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,426 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-11-09 22:43:18,430 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-11-09 22:43:18,430 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:18,516 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 119 [2018-11-09 22:43:18,516 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,616 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-11-09 22:43:18,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,620 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-11-09 22:43:18,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:18,625 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-11-09 22:43:18,626 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,642 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,683 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:18,745 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 96 treesize of output 87 [2018-11-09 22:43:18,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:18,748 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:18,752 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 36 treesize of output 76 [2018-11-09 22:43:18,752 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,766 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:18,827 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,024 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-11-09 22:43:19,028 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-11-09 22:43:19,028 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,096 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-11-09 22:43:19,096 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,169 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-11-09 22:43:19,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,172 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-11-09 22:43:19,172 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,183 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,251 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-11-09 22:43:19,254 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,255 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-11-09 22:43:19,255 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,321 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 146 [2018-11-09 22:43:19,322 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,361 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,426 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-11-09 22:43:19,429 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,431 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-11-09 22:43:19,431 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:19,479 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-11-09 22:43:19,479 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,502 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,531 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,573 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:19,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,581 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-11-09 22:43:19,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:19,584 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,609 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-11-09 22:43:19,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:19,615 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-11-09 22:43:19,615 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,635 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-11-09 22:43:19,643 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-11-09 22:43:19,643 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,657 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,676 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,700 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:19,827 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 112 treesize of output 109 [2018-11-09 22:43:19,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:19,832 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,846 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,851 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 129 [2018-11-09 22:43:19,853 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-11-09 22:43:19,853 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,869 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,874 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-11-09 22:43:19,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-09 22:43:19,877 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,892 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,896 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-11-09 22:43:19,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:19,899 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,912 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,916 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-11-09 22:43:19,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 22 treesize of output 21 [2018-11-09 22:43:19,918 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,928 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,932 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-11-09 22:43:19,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:19,934 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,946 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,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 104 treesize of output 115 [2018-11-09 22:43:19,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 22 treesize of output 21 [2018-11-09 22:43:19,952 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:19,964 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,081 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 7 xjuncts. [2018-11-09 22:43:20,082 INFO L202 ElimStorePlain]: Needed 94 recursive calls to eliminate 9 variables, input treesize:330, output treesize:721 [2018-11-09 22:43:20,563 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 129 [2018-11-09 22:43:20,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 71 [2018-11-09 22:43:20,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,579 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-11-09 22:43:20,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,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, 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-11-09 22:43:20,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,707 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-11-09 22:43:20,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:20,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,721 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-11-09 22:43:20,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:20,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,825 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 114 treesize of output 90 [2018-11-09 22:43:20,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,827 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 53 treesize of output 41 [2018-11-09 22:43:20,827 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-09 22:43:20,837 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,932 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 53 treesize of output 42 [2018-11-09 22:43:20,934 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 16 treesize of output 12 [2018-11-09 22:43:20,934 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:20,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:20,942 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 13 treesize of output 6 [2018-11-09 22:43:20,942 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:20,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:21,036 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 111 [2018-11-09 22:43:21,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:21,041 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 84 treesize of output 71 [2018-11-09 22:43:21,041 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,094 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 91 treesize of output 66 [2018-11-09 22:43:21,095 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:21,150 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 88 treesize of output 72 [2018-11-09 22:43:21,151 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:21,201 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 95 treesize of output 71 [2018-11-09 22:43:21,201 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:43:21,250 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 71 treesize of output 60 [2018-11-09 22:43:21,250 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,298 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 72 treesize of output 56 [2018-11-09 22:43:21,299 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,342 INFO L267 ElimStorePlain]: Start of recursive call 13: 6 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-09 22:43:21,471 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 76 [2018-11-09 22:43:21,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:21,475 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 64 treesize of output 57 [2018-11-09 22:43:21,475 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,497 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,620 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 46 treesize of output 42 [2018-11-09 22:43:21,621 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 38 treesize of output 29 [2018-11-09 22:43:21,622 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,636 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 25 [2018-11-09 22:43:21,636 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,649 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 34 treesize of output 27 [2018-11-09 22:43:21,649 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,661 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,731 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-11-09 22:43:21,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:21,734 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-11-09 22:43:21,735 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,740 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,793 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 90 treesize of output 78 [2018-11-09 22:43:21,795 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 66 treesize of output 52 [2018-11-09 22:43:21,795 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,823 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 74 treesize of output 65 [2018-11-09 22:43:21,824 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,844 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 65 treesize of output 51 [2018-11-09 22:43:21,844 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,861 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:21,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:21,911 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 59 treesize of output 47 [2018-11-09 22:43:21,913 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 18 treesize of output 6 [2018-11-09 22:43:21,913 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,919 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 12 [2018-11-09 22:43:21,919 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,923 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-11-09 22:43:21,967 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-11-09 22:43:21,967 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:21,971 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,064 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 125 treesize of output 89 [2018-11-09 22:43:22,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 85 treesize of output 65 [2018-11-09 22:43:22,068 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,097 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:43:22,100 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 81 treesize of output 64 [2018-11-09 22:43:22,100 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,127 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 65 treesize of output 46 [2018-11-09 22:43:22,127 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,149 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,196 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 42 treesize of output 42 [2018-11-09 22:43:22,201 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 28 treesize of output 18 [2018-11-09 22:43:22,201 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,217 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-11-09 22:43:22,217 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,229 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 14 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-09 22:43:22,263 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 23 variables, input treesize:791, output treesize:66 [2018-11-09 22:43:22,441 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-11-09 22:43:22,452 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-11-09 22:43:22,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,470 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-11-09 22:43:22,471 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-11-09 22:43:22,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,481 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-11-09 22:43:22,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,489 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-11-09 22:43:22,489 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:22,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:22,505 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:43, output treesize:18 [2018-11-09 22:43:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 22:43:22,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:43:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 66 [2018-11-09 22:43:22,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-09 22:43:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-09 22:43:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4034, Unknown=30, NotChecked=0, Total=4290 [2018-11-09 22:43:22,551 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 66 states. [2018-11-09 22:43:24,116 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-11-09 22:43:26,189 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-11-09 22:43:26,741 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-11-09 22:43:27,083 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 88 [2018-11-09 22:43:27,315 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 97 [2018-11-09 22:43:27,619 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 95 [2018-11-09 22:43:27,896 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 97 [2018-11-09 22:43:28,271 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 95 [2018-11-09 22:43:28,719 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 85 [2018-11-09 22:43:28,910 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 93 [2018-11-09 22:43:29,136 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 93 [2018-11-09 22:43:29,343 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 95 [2018-11-09 22:43:29,563 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 94 [2018-11-09 22:43:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:29,587 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2018-11-09 22:43:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-09 22:43:29,587 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 83 [2018-11-09 22:43:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:29,587 INFO L225 Difference]: With dead ends: 180 [2018-11-09 22:43:29,587 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 22:43:29,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=641, Invalid=10440, Unknown=49, NotChecked=0, Total=11130 [2018-11-09 22:43:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 22:43:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 22:43:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 22:43:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:43:29,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-11-09 22:43:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:29,590 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:43:29,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-09 22:43:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:43:29,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 22:43:29,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 22:43:29,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 22:43:29,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 22:43:30,175 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-09 22:43:30,229 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-09 22:43:30,229 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L585-1(line 585) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-11-09 22:43:30,230 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-09 22:43:30,230 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-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-11-09 22:43:30,230 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:43:30,231 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-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:43:30,231 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-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L601(line 601) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L601-1(lines 598 602) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-09 22:43:30,231 INFO L425 ceAbstractionStarter]: For program point L595-1(line 595) no Hoare annotation was computed. [2018-11-09 22:43:30,232 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-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-11-09 22:43:30,232 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-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L592-1(line 592) no Hoare annotation was computed. [2018-11-09 22:43:30,232 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-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:43:30,232 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L428 ceAbstractionStarter]: At program point L638-1(line 638) the Hoare annotation is: true [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L638-2(line 638) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-11-09 22:43:30,232 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-11-09 22:43:30,233 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-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-11-09 22:43:30,233 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-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L615(line 615) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L615-1(line 615) no Hoare annotation was computed. [2018-11-09 22:43:30,233 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-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-11-09 22:43:30,233 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-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L628-1(line 628) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L616(line 616) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 616 618) no Hoare annotation was computed. [2018-11-09 22:43:30,233 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 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-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-2(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 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-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-3(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-4(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-5(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-6(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L608-7(line 608) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L629-1(lines 629 631) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L625-1(line 625) no Hoare annotation was computed. [2018-11-09 22:43:30,234 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-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-09 22:43:30,234 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-11-09 22:43:30,235 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-09 22:43:30,235 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-09 22:43:30,235 INFO L425 ceAbstractionStarter]: For program point L565-1(line 565) no Hoare annotation was computed. [2018-11-09 22:43:30,235 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-11-09 22:43:30,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,243 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,247 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,249 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,249 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,249 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,250 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,250 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,251 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,252 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,255 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,256 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,256 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,256 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,256 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,257 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,266 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-11-09 22:43:30,271 INFO L168 Benchmark]: Toolchain (without parser) took 26874.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 957.6 MB in the beginning and 916.0 MB in the end (delta: 41.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. [2018-11-09 22:43:30,272 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:43:30,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.28 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:43:30,272 INFO L168 Benchmark]: Boogie Preprocessor took 87.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:43:30,272 INFO L168 Benchmark]: RCFGBuilder took 425.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:43:30,272 INFO L168 Benchmark]: TraceAbstraction took 26058.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 916.0 MB in the end (delta: 140.3 MB). Peak memory consumption was 367.3 MB. Max. memory is 11.5 GB. [2018-11-09 22:43:30,273 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.28 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26058.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 916.0 MB in the end (delta: 140.3 MB). Peak memory consumption was 367.3 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-11-09 22:43:30,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,277 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,278 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-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,279 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,280 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-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-11-09 22:43:30,281 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-11-09 22:43:30,282 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,282 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,282 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,282 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:43:30,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:43:30,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:43:30,285 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:43:30,285 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-11-09 22:43:31,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:43:31,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:43:31,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:43:31,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:43:31,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:43:31,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:43:31,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:43:31,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:43:31,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:43:31,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:43:31,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:43:31,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:43:31,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:43:31,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:43:31,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:43:31,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:43:31,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:43:31,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:43:31,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:43:31,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:43:31,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:43:31,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:43:31,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:43:31,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:43:31,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:43:31,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:43:31,744 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:43:31,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:43:31,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:43:31,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:43:31,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:43:31,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:43:31,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:43:31,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:43:31,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:43:31,749 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-09 22:43:31,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:43:31,759 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:43:31,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 22:43:31,760 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 22:43:31,760 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:43:31,760 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:43:31,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 22:43:31,761 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 22:43:31,762 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-09 22:43:31,762 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-09 22:43:31,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 22:43:31,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 22:43:31,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:43:31,764 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-09 22:43:31,765 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-09 22:43:31,765 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_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:31,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:43:31,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:43:31,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:43:31,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:43:31,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:43:31,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:31,851 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/b0d4b1fe7/bccf243509f24cd9860c6a602a1c046d/FLAG67f804f9c [2018-11-09 22:43:32,288 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:43:32,289 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:32,297 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/b0d4b1fe7/bccf243509f24cd9860c6a602a1c046d/FLAG67f804f9c [2018-11-09 22:43:32,307 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/data/b0d4b1fe7/bccf243509f24cd9860c6a602a1c046d [2018-11-09 22:43:32,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:43:32,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 22:43:32,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:43:32,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:43:32,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:43:32,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f487037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32, skipping insertion in model container [2018-11-09 22:43:32,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:43:32,350 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:43:32,554 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:43:32,563 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:43:32,601 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:43:32,630 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:43:32,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32 WrapperNode [2018-11-09 22:43:32,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:43:32,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:43:32,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:43:32,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:43:32,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... [2018-11-09 22:43:32,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:43:32,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:43:32,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:43:32,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:43:32,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:43:32,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 22:43:32,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-09 22:43:32,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-09 22:43:32,772 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-09 22:43:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-09 22:43:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-09 22:43:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-09 22:43:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-09 22:43:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-09 22:43:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-09 22:43:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-09 22:43:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-09 22:43:32,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-09 22:43:32,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-09 22:43:32,781 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-09 22:43:32,782 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-09 22:43:32,783 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-09 22:43:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-09 22:43:32,785 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-09 22:43:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 22:43:32,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-09 22:43:32,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 22:43:32,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:43:32,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-09 22:43:33,171 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:43:33,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:43:33 BoogieIcfgContainer [2018-11-09 22:43:33,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:43:33,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 22:43:33,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 22:43:33,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 22:43:33,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:43:32" (1/3) ... [2018-11-09 22:43:33,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebf44c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:43:33, skipping insertion in model container [2018-11-09 22:43:33,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:43:32" (2/3) ... [2018-11-09 22:43:33,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebf44c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:43:33, skipping insertion in model container [2018-11-09 22:43:33,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:43:33" (3/3) ... [2018-11-09 22:43:33,180 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-09 22:43:33,188 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 22:43:33,195 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 22:43:33,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 22:43:33,223 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:43:33,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 22:43:33,223 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 22:43:33,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 22:43:33,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:43:33,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:43:33,224 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 22:43:33,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:43:33,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 22:43:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-11-09 22:43:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-09 22:43:33,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:33,242 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-11-09 22:43:33,244 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:33,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash -960913746, now seen corresponding path program 1 times [2018-11-09 22:43:33,250 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:43:33,251 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:33,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:43:33,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-09 22:43:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 22:43:33,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-09 22:43:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 22:43:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 22:43:33,375 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-11-09 22:43:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:33,398 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2018-11-09 22:43:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 22:43:33,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2018-11-09 22:43:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:33,408 INFO L225 Difference]: With dead ends: 162 [2018-11-09 22:43:33,408 INFO L226 Difference]: Without dead ends: 67 [2018-11-09 22:43:33,412 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-11-09 22:43:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-09 22:43:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-09 22:43:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-09 22:43:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-09 22:43:33,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 42 [2018-11-09 22:43:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:33,444 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-09 22:43:33,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-09 22:43:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-09 22:43:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-09 22:43:33,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:33,447 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-11-09 22:43:33,447 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:33,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1636984481, now seen corresponding path program 1 times [2018-11-09 22:43:33,448 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:43:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:33,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:33,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:43:33,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-09 22:43:33,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 22:43:33,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 22:43:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 22:43:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 22:43:33,568 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 5 states. [2018-11-09 22:43:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:33,662 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-11-09 22:43:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 22:43:33,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-09 22:43:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:33,664 INFO L225 Difference]: With dead ends: 125 [2018-11-09 22:43:33,664 INFO L226 Difference]: Without dead ends: 74 [2018-11-09 22:43:33,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:43:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-09 22:43:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-09 22:43:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-09 22:43:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-11-09 22:43:33,674 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 45 [2018-11-09 22:43:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:33,674 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-11-09 22:43:33,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 22:43:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-11-09 22:43:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-09 22:43:33,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:33,676 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-11-09 22:43:33,676 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:33,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1524962591, now seen corresponding path program 1 times [2018-11-09 22:43:33,677 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:43:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:33,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:33,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:43:33,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-09 22:43:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 22:43:34,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:43:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-09 22:43:34,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-09 22:43:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-09 22:43:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-09 22:43:34,039 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 9 states. [2018-11-09 22:43:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:34,210 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-11-09 22:43:34,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 22:43:34,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-09 22:43:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:34,214 INFO L225 Difference]: With dead ends: 132 [2018-11-09 22:43:34,215 INFO L226 Difference]: Without dead ends: 81 [2018-11-09 22:43:34,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-09 22:43:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-09 22:43:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-11-09 22:43:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-09 22:43:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-09 22:43:34,223 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 61 [2018-11-09 22:43:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:34,224 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-09 22:43:34,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-09 22:43:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-09 22:43:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-09 22:43:34,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:34,225 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-11-09 22:43:34,225 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:34,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1718423775, now seen corresponding path program 2 times [2018-11-09 22:43:34,227 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:43:34,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:34,242 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-09 22:43:34,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-09 22:43:34,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 22:43:34,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-09 22:43:34,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-09 22:43:34,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:43:34,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-09 22:43:34,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 22:43:34,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 22:43:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:43:34,360 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2018-11-09 22:43:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:43:34,453 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-11-09 22:43:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 22:43:34,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-09 22:43:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:43:34,454 INFO L225 Difference]: With dead ends: 107 [2018-11-09 22:43:34,454 INFO L226 Difference]: Without dead ends: 80 [2018-11-09 22:43:34,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-09 22:43:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-09 22:43:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-09 22:43:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-09 22:43:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-09 22:43:34,462 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 77 [2018-11-09 22:43:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:43:34,462 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-09 22:43:34,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 22:43:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-09 22:43:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 22:43:34,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:43:34,464 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-11-09 22:43:34,464 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:43:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:43:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1758906760, now seen corresponding path program 1 times [2018-11-09 22:43:34,465 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:43:34,465 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:43:34,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:43:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:34,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:34,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 22:43:34,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-09 22:43:34,653 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-11-09 22:43:34,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:34,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:43:34,841 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-11-09 22:43:34,848 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-11-09 22:43:34,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,867 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-11-09 22:43:34,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:27 [2018-11-09 22:43:34,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:34,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:34,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:34,932 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-11-09 22:43:34,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-11-09 22:43:35,092 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-11-09 22:43:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 27 not checked. [2018-11-09 22:43:35,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-09 22:43:35,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:43:35,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:43:35,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:43:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:43:35,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:43:37,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:43:37,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:43:37,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-09 22:43:37,199 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-11-09 22:43:37,203 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-11-09 22:43:37,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,259 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-11-09 22:43:37,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:37,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:37,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:43:37,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-11-09 22:43:37,481 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-11-09 22:43:37,483 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-11-09 22:43:37,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:37,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-09 22:43:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-09 22:43:37,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-09 22:43:38,099 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-11-09 22:43:38,131 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-11-09 22:43:38,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,143 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-11-09 22:43:38,145 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-11-09 22:43:38,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2018-11-09 22:43:38,531 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-11-09 22:43:38,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-09 22:43:38,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,613 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-11-09 22:43:38,617 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-11-09 22:43:38,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,643 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-11-09 22:43:38,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,677 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-11-09 22:43:38,678 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:38,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:38,711 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-11-09 22:43:38,714 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-11-09 22:43:38,715 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,745 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-11-09 22:43:38,746 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:38,768 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-11-09 22:43:38,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,783 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:38,786 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-11-09 22:43:38,788 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-11-09 22:43:38,788 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,796 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:38,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-09 22:43:38,996 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-11-09 22:43:39,028 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-11-09 22:43:39,029 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,068 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-11-09 22:43:39,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-09 22:43:39,072 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,103 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-11-09 22:43:39,103 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:39,128 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-11-09 22:43:39,128 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,143 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:39,145 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-11-09 22:43:39,147 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-11-09 22:43:39,147 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,154 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,167 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-11-09 22:43:39,176 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-11-09 22:43:39,177 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-09 22:43:39,201 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 21 treesize of output 15 [2018-11-09 22:43:39,202 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-09 22:43:39,225 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-09 22:43:39,242 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:43:39,291 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-09 22:43:39,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 15 xjuncts. [2018-11-09 22:43:39,405 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:81, output treesize:169 [2018-11-09 22:43:39,661 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-09 22:43:40,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-09 22:43:42,587 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-09 22:43:43,858 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-11-09 22:43:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-09 22:43:48,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-09 22:43:48,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 62 [2018-11-09 22:43:48,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-09 22:43:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-09 22:43:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3305, Unknown=171, NotChecked=238, Total=3906 [2018-11-09 22:43:48,864 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 62 states. [2018-11-09 22:44:02,971 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-11-09 22:44:03,943 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-11-09 22:44:04,928 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-11-09 22:44:05,624 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-09 22:44:06,622 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-11-09 22:44:07,076 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-09 22:44:07,836 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-09 22:44:08,612 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-11-09 22:44:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:44:10,612 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2018-11-09 22:44:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-09 22:44:10,613 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 81 [2018-11-09 22:44:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:44:10,615 INFO L225 Difference]: With dead ends: 183 [2018-11-09 22:44:10,615 INFO L226 Difference]: Without dead ends: 119 [2018-11-09 22:44:10,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=643, Invalid=9552, Unknown=319, NotChecked=406, Total=10920 [2018-11-09 22:44:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-09 22:44:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-11-09 22:44:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-09 22:44:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-09 22:44:10,630 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 81 [2018-11-09 22:44:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:44:10,630 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-09 22:44:10,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-09 22:44:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-09 22:44:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-09 22:44:10,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:44:10,632 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-11-09 22:44:10,632 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:44:10,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:44:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1827421912, now seen corresponding path program 1 times [2018-11-09 22:44:10,632 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-09 22:44:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/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-11-09 22:44:10,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:10,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:44:10,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 22:44:10,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:10,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:10,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-09 22:44:10,791 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-11-09 22:44:10,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:10,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:10,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:10,993 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-11-09 22:44:10,996 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-11-09 22:44:10,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:11,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:11,020 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-11-09 22:44:11,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:41 [2018-11-09 22:44:11,069 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-11-09 22:44:11,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, 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-11-09 22:44:11,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:11,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:11,093 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-11-09 22:44:11,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:57 [2018-11-09 22:44:11,958 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-11-09 22:44:12,421 WARN L179 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-11-09 22:44:12,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:12,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:12,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:12,454 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:44:12,455 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-11-09 22:44:12,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:12,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-09 22:44:12,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:44:12,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:12,737 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-11-09 22:44:12,744 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-11-09 22:44:12,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:12,804 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-11-09 22:44:12,847 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-11-09 22:44:12,847 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-09 22:44:12,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:44:12,970 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:44:13,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:44:13,136 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-11-09 22:44:13,136 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:193, output treesize:134 [2018-11-09 22:44:13,272 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-11-09 22:44:13,275 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-11-09 22:44:13,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:13,281 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-11-09 22:44:13,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:13,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:13,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:13,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:10 [2018-11-09 22:44:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 23 not checked. [2018-11-09 22:44:13,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-09 22:44:13,852 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-09 22:44:14,077 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-09 22:44:14,211 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-09 22:44:25,700 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-09 22:44:25,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:44:25,702 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:44:25,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:44:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:44:25,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:44:26,128 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-11-09 22:44:26,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:26,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:26,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-09 22:44:27,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:44:27,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:44:27,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:27,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:27,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 22:44:27,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:44:27,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:27,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:27,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:27,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-11-09 22:44:32,062 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2018-11-09 22:44:32,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:32,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:32,086 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-11-09 22:44:32,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:32,142 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-11-09 22:44:32,146 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-11-09 22:44:32,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:32,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:32,280 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-11-09 22:44:32,285 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-11-09 22:44:32,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:32,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:32,857 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-11-09 22:44:32,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:33,673 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-11-09 22:44:33,679 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-11-09 22:44:33,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:34,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:44:34,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,012 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-11-09 22:44:34,013 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:44:34,033 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:44:34,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,380 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-11-09 22:44:34,389 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-11-09 22:44:34,389 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:34,457 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:34,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,624 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-11-09 22:44:34,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:44:34,630 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-11-09 22:44:34,631 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:34,646 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:34,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:34,814 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-11-09 22:44:34,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 22:44:34,826 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-11-09 22:44:34,827 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:44:34,849 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-09 22:44:34,936 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-09 22:44:35,065 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-11-09 22:44:35,687 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-11-09 22:44:35,691 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-11-09 22:44:35,692 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:35,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:35,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:35,980 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-11-09 22:44:35,980 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:36,252 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-11-09 22:44:36,261 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-11-09 22:44:36,262 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,353 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-11-09 22:44:36,354 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,387 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:36,485 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-11-09 22:44:36,488 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-11-09 22:44:36,488 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,499 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,547 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,628 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-11-09 22:44:36,666 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-11-09 22:44:36,666 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 5 variables, input treesize:176, output treesize:83 [2018-11-09 22:44:36,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:44:36,962 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-11-09 22:44:36,965 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-11-09 22:44:36,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-09 22:44:36,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:36,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:37,010 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-11-09 22:44:37,013 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-11-09 22:44:37,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:37,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-09 22:44:37,044 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:37,066 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-11-09 22:44:37,066 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 22:44:37,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:44:37,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 22:44:37,083 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:82, output treesize:16 [2018-11-09 22:44:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-09 22:44:37,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-09 22:44:38,070 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-09 22:44:38,233 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-09 22:44:38,498 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-09 22:44:38,770 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-09 22:44:41,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:44:41,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35] total 65 [2018-11-09 22:44:41,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-11-09 22:44:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-11-09 22:44:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4206, Unknown=168, NotChecked=266, Total=4830 [2018-11-09 22:44:41,463 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 65 states. [2018-11-09 22:44:43,742 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-11-09 22:44:47,378 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-09 22:44:52,893 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-09 22:44:56,685 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-09 22:45:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:45:01,462 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-11-09 22:45:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-09 22:45:01,463 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 81 [2018-11-09 22:45:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:45:01,464 INFO L225 Difference]: With dead ends: 144 [2018-11-09 22:45:01,464 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 22:45:01,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=425, Invalid=8989, Unknown=296, NotChecked=390, Total=10100 [2018-11-09 22:45:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 22:45:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 22:45:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 22:45:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:45:01,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-11-09 22:45:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:45:01,467 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:45:01,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-11-09 22:45:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:45:01,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 22:45:01,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 22:45:01,983 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-11-09 22:45:02,297 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2018-11-09 22:45:02,449 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-11-09 22:45:02,451 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-09 22:45:02,451 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-09 22:45:02,451 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L585-1(line 585) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-11-09 22:45:02,452 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-09 22:45:02,452 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-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-11-09 22:45:02,452 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:45:02,453 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-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-11-09 22:45:02,453 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-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-11-09 22:45:02,453 INFO L425 ceAbstractionStarter]: For program point L601(line 601) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L601-1(lines 598 602) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L595-1(line 595) no Hoare annotation was computed. [2018-11-09 22:45:02,454 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-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-11-09 22:45:02,454 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-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L592-1(line 592) no Hoare annotation was computed. [2018-11-09 22:45:02,454 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-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:45:02,454 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L425 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-11-09 22:45:02,454 INFO L428 ceAbstractionStarter]: At program point L638-1(line 638) the Hoare annotation is: true [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L638-2(line 638) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-11-09 22:45:02,455 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-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-11-09 22:45:02,455 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-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L615(line 615) no Hoare annotation was computed. [2018-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L615-1(line 615) no Hoare annotation was computed. [2018-11-09 22:45:02,455 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-11-09 22:45:02,455 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-11-09 22:45:02,455 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-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L628-1(line 628) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L616(line 616) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 616 618) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 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-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-2(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 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-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-3(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-4(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-5(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-6(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L608-7(line 608) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L629-1(lines 629 631) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L625-1(line 625) no Hoare annotation was computed. [2018-11-09 22:45:02,456 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-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-11-09 22:45:02,456 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point L565-1(line 565) no Hoare annotation was computed. [2018-11-09 22:45:02,457 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-11-09 22:45:02,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,472 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,473 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,475 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,476 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,477 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-09 22:45:02,479 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,479 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,485 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-09 22:45:02,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:45:02 BoogieIcfgContainer [2018-11-09 22:45:02,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 22:45:02,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:45:02,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:45:02,489 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:45:02,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:43:33" (3/4) ... [2018-11-09 22:45:02,492 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 22:45:02,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-09 22:45:02,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 22:45:02,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-09 22:45:02,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-09 22:45:02,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-09 22:45:02,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-09 22:45:02,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-11-09 22:45:02,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 22:45:02,499 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-09 22:45:02,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-09 22:45:02,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-09 22:45:02,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 22:45:02,519 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-11-09 22:45:02,520 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-11-09 22:45:02,536 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_da70fbfa-ed3f-47e2-aa4f-15ee04d9317c/bin-2019/uautomizer/witness.graphml [2018-11-09 22:45:02,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:45:02,536 INFO L168 Benchmark]: Toolchain (without parser) took 90226.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 945.5 MB in the beginning and 956.2 MB in the end (delta: -10.7 MB). Peak memory consumption was 309.6 MB. Max. memory is 11.5 GB. [2018-11-09 22:45:02,537 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-11-09 22:45:02,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 917.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:45:02,537 INFO L168 Benchmark]: Boogie Preprocessor took 105.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -218.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:45:02,538 INFO L168 Benchmark]: RCFGBuilder took 435.49 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: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:45:02,538 INFO L168 Benchmark]: TraceAbstraction took 89314.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 119.9 MB). Peak memory consumption was 291.3 MB. Max. memory is 11.5 GB. [2018-11-09 22:45:02,538 INFO L168 Benchmark]: Witness Printer took 47.08 ms. Allocated memory is still 1.3 GB. Free memory is still 956.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:45:02,539 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 319.30 ms. Allocated memory is still 1.0 GB. Free memory was 945.5 MB in the beginning and 917.5 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -218.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.49 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: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89314.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 119.9 MB). Peak memory consumption was 291.3 MB. Max. memory is 11.5 GB. * Witness Printer took 47.08 ms. Allocated memory is still 1.3 GB. Free memory is still 956.2 MB. There was no memory consumed. 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-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,549 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,549 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:45:02,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_#t~malloc2.base,QUANTIFIED] [2018-11-09 22:45:02,552 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,552 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,553 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,553 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-11-09 22:45:02,553 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,553 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-09 22:45:02,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,554 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,554 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,554 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,555 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-09 22:45:02,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,556 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:45:02,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:45:02,556 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, 89.2s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 42.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 423 SDtfs, 769 SDslu, 4278 SDs, 0 SdLazy, 4597 SolverSat, 164 SolverUnsat, 534 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 564 SyntacticMatches, 3 SemanticMatches, 221 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3492 ImplicationChecksByTransitivity, 55.5s 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, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 45.2s 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...