./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_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_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bb752e40b61404db64f5779eae1f3ed9be1fbd7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bb752e40b61404db64f5779eae1f3ed9be1fbd7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:47:49,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:47:49,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:47:49,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:47:49,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:47:49,834 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:47:49,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:47:49,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:47:49,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:47:49,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:47:49,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:47:49,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:47:49,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:47:49,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:47:49,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:47:49,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:47:49,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:47:49,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:47:49,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:47:49,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:47:49,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:47:49,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:47:49,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:47:49,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:47:49,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:47:49,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:47:49,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:47:49,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:47:49,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:47:49,856 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:47:49,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:47:49,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:47:49,857 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:47:49,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:47:49,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:47:49,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:47:49,859 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 01:47:49,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:47:49,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:47:49,871 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:47:49,871 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:47:49,871 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:47:49,872 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:47:49,872 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 01:47:49,872 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:47:49,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 01:47:49,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 01:47:49,872 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:47:49,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:47:49,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:47:49,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:47:49,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:47:49,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:47:49,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:47:49,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:47:49,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:47:49,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:47:49,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:47:49,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:47:49,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:47:49,876 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:47:49,876 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:47:49,876 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 01:47:49,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:47:49,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:47:49,877 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 01:47:49,877 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan 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 -> Taipan 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 -> 2bb752e40b61404db64f5779eae1f3ed9be1fbd7 [2018-11-10 01:47:49,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:47:49,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:47:49,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:47:49,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:47:49,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:47:49,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:47:49,956 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/9ed51137f/a1b2a0ee7d474f5b8e31e60c41acd4af/FLAG818b6178e [2018-11-10 01:47:50,365 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:47:50,366 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:47:50,376 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/9ed51137f/a1b2a0ee7d474f5b8e31e60c41acd4af/FLAG818b6178e [2018-11-10 01:47:50,386 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/9ed51137f/a1b2a0ee7d474f5b8e31e60c41acd4af [2018-11-10 01:47:50,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:47:50,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:47:50,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:47:50,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:47:50,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:47:50,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19740b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50, skipping insertion in model container [2018-11-10 01:47:50,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:47:50,441 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:47:50,654 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:47:50,662 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:47:50,702 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:47:50,732 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:47:50,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50 WrapperNode [2018-11-10 01:47:50,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:47:50,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:47:50,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:47:50,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:47:50,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:47:50,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:47:50,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:47:50,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:47:50,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... [2018-11-10 01:47:50,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:47:50,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:47:50,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:47:50,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:47:50,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:47:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 01:47:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 01:47:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-10 01:47:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-10 01:47:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:47:50,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:47:50,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:47:50,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:47:50,877 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-10 01:47:50,877 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-10 01:47:50,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:47:50,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:47:51,145 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:47:51,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:47:51 BoogieIcfgContainer [2018-11-10 01:47:51,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:47:51,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:47:51,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:47:51,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:47:51,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:47:50" (1/3) ... [2018-11-10 01:47:51,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f90ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:47:51, skipping insertion in model container [2018-11-10 01:47:51,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:47:50" (2/3) ... [2018-11-10 01:47:51,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f90ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:47:51, skipping insertion in model container [2018-11-10 01:47:51,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:47:51" (3/3) ... [2018-11-10 01:47:51,150 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:47:51,157 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:47:51,163 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:47:51,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:47:51,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:47:51,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:47:51,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:47:51,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:47:51,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:47:51,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:47:51,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:47:51,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:47:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-10 01:47:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 01:47:51,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:51,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:51,218 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:51,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -871676783, now seen corresponding path program 1 times [2018-11-10 01:47:51,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:51,337 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-10 01:47:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:47:51,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:47:51,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:47:51,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:47:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:47:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:47:51,354 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-10 01:47:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:51,369 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-10 01:47:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:47:51,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-10 01:47:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:51,378 INFO L225 Difference]: With dead ends: 59 [2018-11-10 01:47:51,378 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 01:47:51,381 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-10 01:47:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 01:47:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 01:47:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 01:47:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-10 01:47:51,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2018-11-10 01:47:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:51,419 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-10 01:47:51,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:47:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-10 01:47:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 01:47:51,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:51,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:51,420 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:51,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1164667089, now seen corresponding path program 1 times [2018-11-10 01:47:51,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:51,516 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-10 01:47:51,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:47:51,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:47:51,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:47:51,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:47:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:47:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:47:51,518 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-10 01:47:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:51,562 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-10 01:47:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:47:51,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-10 01:47:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:51,566 INFO L225 Difference]: With dead ends: 39 [2018-11-10 01:47:51,566 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 01:47:51,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:47:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 01:47:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-10 01:47:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 01:47:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-10 01:47:51,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-11-10 01:47:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:51,577 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 01:47:51,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:47:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-10 01:47:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 01:47:51,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:51,578 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:51,578 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:51,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -17064785, now seen corresponding path program 1 times [2018-11-10 01:47:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:47:51,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:47:51,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:47:51,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:47:51,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:47:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:47:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:47:51,641 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-10 01:47:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:51,707 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-10 01:47:51,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:47:51,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-10 01:47:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:51,708 INFO L225 Difference]: With dead ends: 58 [2018-11-10 01:47:51,708 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 01:47:51,709 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-10 01:47:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 01:47:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-10 01:47:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 01:47:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-10 01:47:51,715 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-11-10 01:47:51,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:51,715 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-10 01:47:51,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:47:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-10 01:47:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 01:47:51,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:51,716 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:51,716 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:51,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -355703589, now seen corresponding path program 1 times [2018-11-10 01:47:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:47:51,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:47:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:47:51,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:47:51,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:47:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:47:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:47:51,803 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2018-11-10 01:47:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:51,824 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-10 01:47:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:47:51,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 01:47:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:51,825 INFO L225 Difference]: With dead ends: 64 [2018-11-10 01:47:51,825 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 01:47:51,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:47:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 01:47:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-10 01:47:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 01:47:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-10 01:47:51,829 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2018-11-10 01:47:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:51,829 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-10 01:47:51,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:47:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-10 01:47:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 01:47:51,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:51,830 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:51,830 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:51,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash -136848871, now seen corresponding path program 1 times [2018-11-10 01:47:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:51,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:47:51,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:47:51,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:47:51,895 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-10 01:47:51,897 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [22], [24], [29], [31], [35], [36], [40], [42], [46], [49], [51], [54], [58], [61], [64], [67], [70], [74], [75], [78], [79], [80], [82], [83], [84], [85] [2018-11-10 01:47:51,941 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:47:51,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:47:52,296 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:47:52,297 INFO L272 AbstractInterpreter]: Visited 15 different actions 21 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 47 variables. [2018-11-10 01:47:52,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:52,313 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:47:52,536 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 86.64% of their original sizes. [2018-11-10 01:47:52,537 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:47:52,652 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-10 01:47:52,653 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:47:52,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:47:52,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-10 01:47:52,654 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:47:52,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:47:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:47:52,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:47:52,655 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 9 states. [2018-11-10 01:47:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:53,198 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-10 01:47:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:47:53,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-10 01:47:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:53,201 INFO L225 Difference]: With dead ends: 64 [2018-11-10 01:47:53,201 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 01:47:53,202 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:47:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 01:47:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-10 01:47:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 01:47:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-10 01:47:53,211 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2018-11-10 01:47:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:53,211 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-10 01:47:53,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:47:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-10 01:47:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 01:47:53,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:53,212 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:47:53,213 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:53,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1843696955, now seen corresponding path program 1 times [2018-11-10 01:47:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:53,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:53,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:47:53,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:47:53,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:47:53,310 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-10 01:47:53,310 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [22], [24], [27], [29], [31], [35], [36], [40], [42], [46], [49], [51], [54], [58], [61], [64], [67], [70], [74], [75], [78], [79], [80], [82], [83], [84], [85] [2018-11-10 01:47:53,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:47:53,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:47:54,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 01:47:54,102 INFO L272 AbstractInterpreter]: Visited 33 different actions 120 times. Merged at 20 different actions 55 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 5 different actions. Largest state had 47 variables. [2018-11-10 01:47:54,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:54,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 01:47:54,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:47:54,110 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:47:54,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:54,116 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 01:47:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:54,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:47:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:47:54,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:47:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:47:54,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 01:47:54,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-11-10 01:47:54,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 01:47:54,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:47:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:47:54,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:47:54,288 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-10 01:47:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:47:54,355 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-10 01:47:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:47:54,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-10 01:47:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:47:54,358 INFO L225 Difference]: With dead ends: 52 [2018-11-10 01:47:54,359 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 01:47:54,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:47:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 01:47:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 01:47:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 01:47:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-10 01:47:54,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 40 [2018-11-10 01:47:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:47:54,368 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-10 01:47:54,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:47:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-10 01:47:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:47:54,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:47:54,370 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-11-10 01:47:54,370 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:47:54,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:47:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 398232891, now seen corresponding path program 2 times [2018-11-10 01:47:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:47:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:54,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:47:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:47:54,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:47:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:47:55,447 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-10 01:47:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:47:55,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:47:55,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:47:55,711 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 01:47:55,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 01:47:55,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:47:55,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:47:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:47:55,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 01:47:55,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 01:47:55,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:47:55,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:47:55,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:47:55,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:55,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:55,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:47:55,946 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 18 treesize of output 15 [2018-11-10 01:47:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:47:55,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:55,955 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 18 treesize of output 27 [2018-11-10 01:47:55,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:55,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:55,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:55,985 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 18 treesize of output 15 [2018-11-10 01:47:55,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:47:55,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:55,998 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 18 treesize of output 27 [2018-11-10 01:47:55,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,025 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2018-11-10 01:47:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:47:56,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:47:56,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-11-10 01:47:56,124 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 29 treesize of output 30 [2018-11-10 01:47:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:47:56,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,137 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 18 treesize of output 27 [2018-11-10 01:47:56,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,181 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 29 treesize of output 30 [2018-11-10 01:47:56,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:47:56,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,194 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 18 treesize of output 27 [2018-11-10 01:47:56,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,226 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:59 [2018-11-10 01:47:56,249 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 104 treesize of output 90 [2018-11-10 01:47:56,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,256 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 25 treesize of output 41 [2018-11-10 01:47:56,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,284 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 51 treesize of output 44 [2018-11-10 01:47:56,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,288 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 25 treesize of output 41 [2018-11-10 01:47:56,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:121, output treesize:71 [2018-11-10 01:47:56,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-10 01:47:56,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:72 [2018-11-10 01:47:56,553 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 56 treesize of output 60 [2018-11-10 01:47:56,555 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-10 01:47:56,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,584 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 33 treesize of output 54 [2018-11-10 01:47:56,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:47:56,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:94 [2018-11-10 01:47:56,743 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|dll_remove_first_write~$Pointer$_#value.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse3 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) 4))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| .cse2) .cse3))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) (+ (select (select |c_old(#memory_$Pointer$.offset)| .cse2) .cse3) 8) |dll_remove_first_write~$Pointer$_#value.base|)))) (store .cse0 |c_dll_remove_first_#in~head.base| (store (select .cse0 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse1))))))) (exists ((|dll_remove_first_write~$Pointer$_#value.offset| Int)) (= (let ((.cse7 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse8 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) 4))) (let ((.cse5 (select (select |c_old(#memory_$Pointer$.offset)| .cse7) .cse8))) (let ((.cse4 (let ((.cse6 (select (select |c_old(#memory_$Pointer$.base)| .cse7) .cse8))) (store |c_old(#memory_$Pointer$.offset)| .cse6 (store (select |c_old(#memory_$Pointer$.offset)| .cse6) (+ .cse5 8) |dll_remove_first_write~$Pointer$_#value.offset|))))) (store .cse4 |c_dll_remove_first_#in~head.base| (store (select .cse4 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse5))))) |c_#memory_$Pointer$.offset|))) is different from true [2018-11-10 01:47:56,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,756 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:56,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 296 [2018-11-10 01:47:56,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,787 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 41 treesize of output 73 [2018-11-10 01:47:56,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,831 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:56,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 252 [2018-11-10 01:47:56,839 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 187 treesize of output 162 [2018-11-10 01:47:56,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,873 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-10 01:47:56,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:56,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 182 [2018-11-10 01:47:56,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,918 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 39 treesize of output 69 [2018-11-10 01:47:56,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:56,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:56,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 161 [2018-11-10 01:47:56,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 144 [2018-11-10 01:47:56,952 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-10 01:47:56,968 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-10 01:47:56,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:47:56,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:47:56,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:352, output treesize:89 [2018-11-10 01:47:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-10 01:47:57,100 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-10 01:47:57,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,108 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 25 treesize of output 22 [2018-11-10 01:47:57,109 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-10 01:47:57,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-11-10 01:47:57,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:57,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:57,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:57,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 01:47:57,167 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 42 treesize of output 37 [2018-11-10 01:47:57,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,178 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:57,179 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 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-10 01:47:57,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,185 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:57,186 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 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 01:47:57,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:47:57,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-11-10 01:47:57,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:47:57,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 01:47:57,218 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-10 01:47:57,230 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,236 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 17 treesize of output 9 [2018-11-10 01:47:57,236 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,243 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:131, output treesize:18 [2018-11-10 01:47:57,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:47:57,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:47:57,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:47:57,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:47:57,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-10 01:47:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-10 01:47:57,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:47:57,601 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 47 treesize of output 45 [2018-11-10 01:47:57,603 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 5 treesize of output 3 [2018-11-10 01:47:57,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,610 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 47 treesize of output 45 [2018-11-10 01:47:57,611 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 5 treesize of output 3 [2018-11-10 01:47:57,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,617 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 47 treesize of output 45 [2018-11-10 01:47:57,619 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 5 treesize of output 3 [2018-11-10 01:47:57,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:47:57,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:47:57,679 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:105, output treesize:161 [2018-11-10 01:48:01,028 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-10 01:48:01,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 01:48:02,283 WARN L179 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 01:48:02,392 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-10 01:48:02,571 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-10 01:48:02,711 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 01:48:02,955 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 69 [2018-11-10 01:48:02,959 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:02,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1529 treesize of output 1105 [2018-11-10 01:48:03,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-10 01:48:03,032 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 16 treesize of output 17 [2018-11-10 01:48:03,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,064 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,074 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 886 treesize of output 681 [2018-11-10 01:48:03,079 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-10 01:48:03,086 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 16 treesize of output 17 [2018-11-10 01:48:03,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,163 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 682 treesize of output 530 [2018-11-10 01:48:03,273 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-11-10 01:48:03,289 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 22 treesize of output 17 [2018-11-10 01:48:03,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,344 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 891 treesize of output 852 [2018-11-10 01:48:03,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,370 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 35 treesize of output 59 [2018-11-10 01:48:03,372 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:48:03,416 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,417 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,418 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 427 [2018-11-10 01:48:03,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,513 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 271 treesize of output 649 [2018-11-10 01:48:03,515 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:48:03,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,577 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 401 treesize of output 395 [2018-11-10 01:48:03,583 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,583 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,602 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 743 [2018-11-10 01:48:03,604 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 01:48:03,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,633 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 136 treesize of output 247 [2018-11-10 01:48:03,634 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,641 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:03,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,644 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 295 treesize of output 285 [2018-11-10 01:48:03,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,670 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 54 [2018-11-10 01:48:03,682 INFO L267 ElimStorePlain]: Start of recursive call 18: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 31 xjuncts. [2018-11-10 01:48:03,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,764 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 741 [2018-11-10 01:48:03,807 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-11-10 01:48:03,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,813 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:03,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 736 [2018-11-10 01:48:03,839 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-10 01:48:03,899 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:48:03,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,903 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 408 treesize of output 400 [2018-11-10 01:48:03,907 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,911 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,927 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 49 [2018-11-10 01:48:03,933 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 15 xjuncts. [2018-11-10 01:48:03,995 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:03,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:04,003 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 254 treesize of output 486 [2018-11-10 01:48:04,003 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,015 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,058 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:48:04,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,085 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,088 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,089 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 458 treesize of output 447 [2018-11-10 01:48:04,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 34 [2018-11-10 01:48:04,098 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,124 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,127 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 418 treesize of output 427 [2018-11-10 01:48:04,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:04,193 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 140 treesize of output 381 [2018-11-10 01:48:04,193 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 276 [2018-11-10 01:48:04,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:48:04,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:48:04,233 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 743 [2018-11-10 01:48:04,235 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 01:48:04,255 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 1 [2018-11-10 01:48:04,255 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,257 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,259 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,262 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:04,270 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:48:04,278 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-10 01:48:04,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:48:04,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 01:48:04,307 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 22 variables, input treesize:4235, output treesize:47 [2018-11-10 01:48:31,005 WARN L179 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 230 DAG size of output: 156 [2018-11-10 01:48:31,050 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_72 Int)) (or (= (let ((.cse4 (+ c_dll_create_~head~0.offset 4))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_73 (store (select |c_#memory_$Pointer$.offset| v_prenex_73) v_prenex_74 c_dll_create_~head~0.offset)) c_dll_create_~head~0.base) .cse4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| v_prenex_73 (store (select |c_#memory_$Pointer$.base| v_prenex_73) v_prenex_74 c_dll_create_~head~0.base)))) (let ((.cse1 (select (select .cse2 c_dll_create_~head~0.base) .cse4))) (select (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) (+ .cse3 8) v_prenex_72)))) (store .cse0 v_prenex_73 (store (select .cse0 v_prenex_73) v_prenex_74 .cse1))) .cse1))) (+ .cse3 4)))) 0) (= (select |c_old(#valid)| v_prenex_73) 0))) (forall ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int)) (or (= 4 v_prenex_67) (= 0 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_prenex_66 (store (select |c_#memory_$Pointer$.offset| v_prenex_66) v_prenex_67 c_dll_create_~head~0.offset))) (.cse9 (+ c_dll_create_~head~0.offset 4))) (let ((.cse6 (select (select .cse7 c_dll_create_~head~0.base) .cse9))) (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| v_prenex_66 (store (select |c_#memory_$Pointer$.base| v_prenex_66) v_prenex_67 c_dll_create_~head~0.base)) c_dll_create_~head~0.base) .cse9))) (select (let ((.cse5 (store .cse7 .cse8 (store (select .cse7 .cse8) (+ .cse6 8) v_prenex_65)))) (store .cse5 v_prenex_66 (store (select .cse5 v_prenex_66) v_prenex_67 .cse6))) .cse8)) (+ .cse6 4))))))) (forall ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (or (= 4 v_prenex_64) (= 0 (let ((.cse14 (+ c_dll_create_~head~0.offset 4))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_63 (store (select |c_#memory_$Pointer$.offset| v_prenex_63) v_prenex_64 c_dll_create_~head~0.offset)) c_dll_create_~head~0.base) .cse14))) (select (let ((.cse12 (store |c_#memory_$Pointer$.base| v_prenex_63 (store (select |c_#memory_$Pointer$.base| v_prenex_63) v_prenex_64 c_dll_create_~head~0.base)))) (let ((.cse11 (select (select .cse12 c_dll_create_~head~0.base) .cse14))) (select (let ((.cse10 (store .cse12 .cse11 (store (select .cse12 .cse11) (+ .cse13 8) v_prenex_62)))) (store .cse10 v_prenex_63 (store (select .cse10 v_prenex_63) v_prenex_64 .cse11))) .cse11))) (+ .cse13 4))))))) (forall ((|v_main_~#s~0.base_BEFORE_CALL_6| Int) (|v_main_~#s~0.offset_BEFORE_CALL_6| Int)) (or (exists ((|v_dll_create_#t~malloc3.base_9| Int)) (= (select (store |c_old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_6| 1) |v_dll_create_#t~malloc3.base_9|) 0)) (forall ((|v_dll_remove_first_write~$Pointer$_#value.offset_17| Int)) (= 0 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_6| (store (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~head~0.offset))) (.cse19 (+ c_dll_create_~head~0.offset 4))) (let ((.cse16 (select (select .cse17 c_dll_create_~head~0.base) .cse19))) (select (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_6| (store (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~head~0.base)) c_dll_create_~head~0.base) .cse19))) (select (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) (+ .cse16 8) |v_dll_remove_first_write~$Pointer$_#value.offset_17|)))) (store .cse15 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse15 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| .cse16))) .cse18)) (+ .cse16 4)))))))) (forall ((v_prenex_59 Int) (|v_dll_remove_first_write~$Pointer$_#value.base_17| Int) (v_prenex_60 Int)) (or (= (let ((.cse24 (+ c_dll_create_~head~0.offset 4))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_59 (store (select |c_#memory_$Pointer$.offset| v_prenex_59) v_prenex_60 c_dll_create_~head~0.offset)) c_dll_create_~head~0.base) .cse24))) (select (let ((.cse22 (store |c_#memory_$Pointer$.base| v_prenex_59 (store (select |c_#memory_$Pointer$.base| v_prenex_59) v_prenex_60 c_dll_create_~head~0.base)))) (let ((.cse21 (select (select .cse22 c_dll_create_~head~0.base) .cse24))) (select (let ((.cse20 (store .cse22 .cse21 (store (select .cse22 .cse21) (+ .cse23 8) |v_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse20 v_prenex_59 (store (select .cse20 v_prenex_59) v_prenex_60 .cse21))) .cse21))) (+ .cse23 4)))) 0) (exists ((v_prenex_61 Int)) (= (select (store |c_old(#valid)| v_prenex_59 1) v_prenex_61) 0))))) is different from false [2018-11-10 01:48:31,105 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((|v_main_~#s~0.base_BEFORE_CALL_6| Int) (|v_main_~#s~0.offset_BEFORE_CALL_6| Int)) (or (exists ((|v_dll_create_#t~malloc3.base_9| Int)) (= (select (store |c_old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_6| 1) |v_dll_create_#t~malloc3.base_9|) 0)) (forall ((|v_dll_remove_first_write~$Pointer$_#value.offset_17| Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_6| (store (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.offset))) (.cse4 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse1 (select (select .cse2 c_dll_create_~new_head~0.base) .cse4))) (select (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_6| (store (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.base)) c_dll_create_~new_head~0.base) .cse4))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ .cse1 8) |v_dll_remove_first_write~$Pointer$_#value.offset_17|)))) (store .cse0 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse0 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| .cse1))) .cse3)) (+ .cse1 4)))) 0)))) (forall ((v_prenex_59 Int) (|v_dll_remove_first_write~$Pointer$_#value.base_17| Int) (v_prenex_60 Int)) (or (= 0 (let ((.cse9 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_59 (store (select |c_#memory_$Pointer$.offset| v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.offset)) c_dll_create_~new_head~0.base) .cse9))) (select (let ((.cse7 (store |c_#memory_$Pointer$.base| v_prenex_59 (store (select |c_#memory_$Pointer$.base| v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.base)))) (let ((.cse6 (select (select .cse7 c_dll_create_~new_head~0.base) .cse9))) (select (let ((.cse5 (store .cse7 .cse6 (store (select .cse7 .cse6) (+ .cse8 8) |v_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse5 v_prenex_59 (store (select .cse5 v_prenex_59) v_prenex_60 .cse6))) .cse6))) (+ .cse8 4))))) (exists ((v_prenex_61 Int)) (= (select (store |c_old(#valid)| v_prenex_59 1) v_prenex_61) 0)))) (forall ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (or (= (let ((.cse14 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_63 (store (select |c_#memory_$Pointer$.offset| v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.offset)) c_dll_create_~new_head~0.base) .cse14))) (select (let ((.cse12 (store |c_#memory_$Pointer$.base| v_prenex_63 (store (select |c_#memory_$Pointer$.base| v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.base)))) (let ((.cse11 (select (select .cse12 c_dll_create_~new_head~0.base) .cse14))) (select (let ((.cse10 (store .cse12 .cse11 (store (select .cse12 .cse11) (+ .cse13 8) v_prenex_62)))) (store .cse10 v_prenex_63 (store (select .cse10 v_prenex_63) v_prenex_64 .cse11))) .cse11))) (+ .cse13 4)))) 0) (= 4 v_prenex_64))) (forall ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int)) (or (= 4 v_prenex_67) (= (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_prenex_66 (store (select |c_#memory_$Pointer$.offset| v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.offset))) (.cse19 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse16 (select (select .cse17 c_dll_create_~new_head~0.base) .cse19))) (select (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| v_prenex_66 (store (select |c_#memory_$Pointer$.base| v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.base)) c_dll_create_~new_head~0.base) .cse19))) (select (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) (+ .cse16 8) v_prenex_65)))) (store .cse15 v_prenex_66 (store (select .cse15 v_prenex_66) v_prenex_67 .cse16))) .cse18)) (+ .cse16 4)))) 0))) (forall ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_72 Int)) (or (= 0 (let ((.cse24 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse23 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_73 (store (select |c_#memory_$Pointer$.offset| v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.offset)) c_dll_create_~new_head~0.base) .cse24))) (select (let ((.cse22 (store |c_#memory_$Pointer$.base| v_prenex_73 (store (select |c_#memory_$Pointer$.base| v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.base)))) (let ((.cse21 (select (select .cse22 c_dll_create_~new_head~0.base) .cse24))) (select (let ((.cse20 (store .cse22 .cse21 (store (select .cse22 .cse21) (+ .cse23 8) v_prenex_72)))) (store .cse20 v_prenex_73 (store (select .cse20 v_prenex_73) v_prenex_74 .cse21))) .cse21))) (+ .cse23 4))))) (= (select |c_old(#valid)| v_prenex_73) 0)))) is different from false [2018-11-10 01:48:31,166 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (or (= 4 v_prenex_67) (= 0 (let ((.cse5 (+ c_dll_create_~head~0.offset 8))) (let ((.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base) .cse5 v_prenex_83)))) (store .cse7 v_prenex_66 (store (select .cse7 v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.offset)))) (.cse6 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse1 (select (select .cse2 c_dll_create_~new_head~0.base) .cse6))) (select (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_create_~head~0.base) .cse5 v_prenex_82)))) (store .cse4 v_prenex_66 (store (select .cse4 v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.base))) c_dll_create_~new_head~0.base) .cse6))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ .cse1 8) v_prenex_65)))) (store .cse0 v_prenex_66 (store (select .cse0 v_prenex_66) v_prenex_67 .cse1))) .cse3)) (+ .cse1 4)))))))) (forall ((v_prenex_63 Int) (v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (or (= 0 (let ((.cse14 (+ c_dll_create_~head~0.offset 8)) (.cse12 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse11 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base) .cse14 v_prenex_85)))) (store .cse15 v_prenex_63 (store (select .cse15 v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse12))) (select (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.base| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_create_~head~0.base) .cse14 v_prenex_84)))) (store .cse13 v_prenex_63 (store (select .cse13 v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.base))))) (let ((.cse9 (select (select .cse10 c_dll_create_~new_head~0.base) .cse12))) (select (let ((.cse8 (store .cse10 .cse9 (store (select .cse10 .cse9) (+ .cse11 8) v_prenex_62)))) (store .cse8 v_prenex_63 (store (select .cse8 v_prenex_63) v_prenex_64 .cse9))) .cse9))) (+ .cse11 4))))) (= 4 v_prenex_64))) (forall ((v_prenex_59 Int) (|v_dll_remove_first_write~$Pointer$_#value.base_17| Int) (v_prenex_78 Int) (v_prenex_79 Int) (v_prenex_60 Int)) (or (= 0 (let ((.cse22 (+ c_dll_create_~head~0.offset 8)) (.cse20 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse19 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base) .cse22 v_prenex_79)))) (store .cse23 v_prenex_59 (store (select .cse23 v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse20))) (select (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_create_~head~0.base) .cse22 v_prenex_78)))) (store .cse21 v_prenex_59 (store (select .cse21 v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.base))))) (let ((.cse17 (select (select .cse18 c_dll_create_~new_head~0.base) .cse20))) (select (let ((.cse16 (store .cse18 .cse17 (store (select .cse18 .cse17) (+ .cse19 8) |v_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse16 v_prenex_59 (store (select .cse16 v_prenex_59) v_prenex_60 .cse17))) .cse17))) (+ .cse19 4))))) (exists ((v_prenex_61 Int)) (= (select (store |c_old(#valid)| v_prenex_59 1) v_prenex_61) 0)))) (forall ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_81 Int) (v_prenex_80 Int) (v_prenex_72 Int)) (or (= 0 (let ((.cse30 (+ c_dll_create_~head~0.offset 8)) (.cse28 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse27 (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base) .cse30 v_prenex_81)))) (store .cse31 v_prenex_73 (store (select .cse31 v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse28))) (select (let ((.cse26 (let ((.cse29 (store |c_#memory_$Pointer$.base| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_create_~head~0.base) .cse30 v_prenex_80)))) (store .cse29 v_prenex_73 (store (select .cse29 v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.base))))) (let ((.cse25 (select (select .cse26 c_dll_create_~new_head~0.base) .cse28))) (select (let ((.cse24 (store .cse26 .cse25 (store (select .cse26 .cse25) (+ .cse27 8) v_prenex_72)))) (store .cse24 v_prenex_73 (store (select .cse24 v_prenex_73) v_prenex_74 .cse25))) .cse25))) (+ .cse27 4))))) (= (select |c_old(#valid)| v_prenex_73) 0))) (forall ((|v_dll_create_write~$Pointer$_#value.base_18| Int) (|v_dll_create_write~$Pointer$_#value.offset_18| Int) (|v_main_~#s~0.base_BEFORE_CALL_6| Int) (|v_main_~#s~0.offset_BEFORE_CALL_6| Int)) (or (exists ((|v_dll_create_#t~malloc3.base_9| Int)) (= (select (store |c_old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_6| 1) |v_dll_create_#t~malloc3.base_9|) 0)) (forall ((|v_dll_remove_first_write~$Pointer$_#value.offset_17| Int)) (= 0 (let ((.cse37 (+ c_dll_create_~head~0.offset 8))) (let ((.cse34 (let ((.cse39 (store |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.offset| c_dll_create_~head~0.base) .cse37 |v_dll_create_write~$Pointer$_#value.offset_18|)))) (store .cse39 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse39 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.offset)))) (.cse38 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse33 (select (select .cse34 c_dll_create_~new_head~0.base) .cse38))) (select (let ((.cse35 (select (select (let ((.cse36 (store |c_#memory_$Pointer$.base| c_dll_create_~head~0.base (store (select |c_#memory_$Pointer$.base| c_dll_create_~head~0.base) .cse37 |v_dll_create_write~$Pointer$_#value.base_18|)))) (store .cse36 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse36 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.base))) c_dll_create_~new_head~0.base) .cse38))) (select (let ((.cse32 (store .cse34 .cse35 (store (select .cse34 .cse35) (+ .cse33 8) |v_dll_remove_first_write~$Pointer$_#value.offset_17|)))) (store .cse32 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse32 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| .cse33))) .cse35)) (+ .cse33 4)))))))))) is different from false [2018-11-10 01:48:31,284 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int) (v_prenex_92 Int) (v_prenex_83 Int) (v_prenex_93 Int) (v_prenex_82 Int)) (or (= (let ((.cse6 (+ c_dll_create_~head~0.offset 8)) (.cse7 (+ c_dll_create_~new_head~0.offset 4)) (.cse8 (+ c_dll_create_~new_head~0.offset 8))) (let ((.cse2 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base) .cse7 c_dll_create_~head~0.offset) .cse8 v_prenex_93)))) (store .cse10 c_dll_create_~head~0.base (store (select .cse10 c_dll_create_~head~0.base) .cse6 v_prenex_83))))) (store .cse9 v_prenex_66 (store (select .cse9 v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.offset))))) (let ((.cse1 (select (select .cse2 c_dll_create_~new_head~0.base) .cse7))) (select (let ((.cse3 (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base) .cse7 c_dll_create_~head~0.base) .cse8 v_prenex_92)))) (store .cse5 c_dll_create_~head~0.base (store (select .cse5 c_dll_create_~head~0.base) .cse6 v_prenex_82))))) (store .cse4 v_prenex_66 (store (select .cse4 v_prenex_66) v_prenex_67 c_dll_create_~new_head~0.base))) c_dll_create_~new_head~0.base) .cse7))) (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ .cse1 8) v_prenex_65)))) (store .cse0 v_prenex_66 (store (select .cse0 v_prenex_66) v_prenex_67 .cse1))) .cse3)) (+ .cse1 4))))) 0) (= 4 v_prenex_67))) (forall ((v_prenex_59 Int) (|v_dll_remove_first_write~$Pointer$_#value.base_17| Int) (v_prenex_78 Int) (v_prenex_79 Int) (v_prenex_87 Int) (v_prenex_86 Int) (v_prenex_60 Int)) (or (exists ((v_prenex_61 Int)) (= (select (store |c_old(#valid)| v_prenex_59 1) v_prenex_61) 0)) (= 0 (let ((.cse18 (+ c_dll_create_~head~0.offset 8)) (.cse19 (+ c_dll_create_~new_head~0.offset 8)) (.cse15 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse14 (select (select (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base) .cse15 c_dll_create_~head~0.offset) .cse19 v_prenex_86)))) (store .cse21 c_dll_create_~head~0.base (store (select .cse21 c_dll_create_~head~0.base) .cse18 v_prenex_79))))) (store .cse20 v_prenex_59 (store (select .cse20 v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse15))) (select (let ((.cse13 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base) .cse15 c_dll_create_~head~0.base) .cse19 v_prenex_87)))) (store .cse17 c_dll_create_~head~0.base (store (select .cse17 c_dll_create_~head~0.base) .cse18 v_prenex_78))))) (store .cse16 v_prenex_59 (store (select .cse16 v_prenex_59) v_prenex_60 c_dll_create_~new_head~0.base))))) (let ((.cse12 (select (select .cse13 c_dll_create_~new_head~0.base) .cse15))) (select (let ((.cse11 (store .cse13 .cse12 (store (select .cse13 .cse12) (+ .cse14 8) |v_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse11 v_prenex_59 (store (select .cse11 v_prenex_59) v_prenex_60 .cse12))) .cse12))) (+ .cse14 4))))))) (forall ((|v_dll_create_write~$Pointer$_#value.offset_18| Int) (|v_dll_create_write~$Pointer$_#value.base_18| Int) (|v_dll_create_write~$Pointer$_#value.offset_19| Int) (|v_main_~#s~0.base_BEFORE_CALL_6| Int) (|v_dll_create_write~$Pointer$_#value.base_19| Int) (|v_main_~#s~0.offset_BEFORE_CALL_6| Int)) (or (exists ((|v_dll_create_#t~malloc3.base_9| Int)) (= (select (store |c_old(#valid)| |v_main_~#s~0.base_BEFORE_CALL_6| 1) |v_dll_create_#t~malloc3.base_9|) 0)) (forall ((|v_dll_remove_first_write~$Pointer$_#value.offset_17| Int)) (= 0 (let ((.cse28 (+ c_dll_create_~head~0.offset 8)) (.cse29 (+ c_dll_create_~new_head~0.offset 4)) (.cse30 (+ c_dll_create_~new_head~0.offset 8))) (let ((.cse24 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base) .cse29 c_dll_create_~head~0.offset) .cse30 |v_dll_create_write~$Pointer$_#value.offset_19|)))) (store .cse32 c_dll_create_~head~0.base (store (select .cse32 c_dll_create_~head~0.base) .cse28 |v_dll_create_write~$Pointer$_#value.offset_18|))))) (store .cse31 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse31 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.offset))))) (let ((.cse23 (select (select .cse24 c_dll_create_~new_head~0.base) .cse29))) (select (let ((.cse25 (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base) .cse29 c_dll_create_~head~0.base) .cse30 |v_dll_create_write~$Pointer$_#value.base_19|)))) (store .cse27 c_dll_create_~head~0.base (store (select .cse27 c_dll_create_~head~0.base) .cse28 |v_dll_create_write~$Pointer$_#value.base_18|))))) (store .cse26 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse26 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| c_dll_create_~new_head~0.base))) c_dll_create_~new_head~0.base) .cse29))) (select (let ((.cse22 (store .cse24 .cse25 (store (select .cse24 .cse25) (+ .cse23 8) |v_dll_remove_first_write~$Pointer$_#value.offset_17|)))) (store .cse22 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse22 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| .cse23))) .cse25)) (+ .cse23 4))))))))) (forall ((v_prenex_90 Int) (v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_81 Int) (v_prenex_80 Int) (v_prenex_91 Int) (v_prenex_72 Int)) (or (= 0 (let ((.cse40 (+ c_dll_create_~head~0.offset 8)) (.cse41 (+ c_dll_create_~new_head~0.offset 8)) (.cse37 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse36 (select (select (let ((.cse42 (let ((.cse43 (store |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base) .cse37 c_dll_create_~head~0.offset) .cse41 v_prenex_91)))) (store .cse43 c_dll_create_~head~0.base (store (select .cse43 c_dll_create_~head~0.base) .cse40 v_prenex_81))))) (store .cse42 v_prenex_73 (store (select .cse42 v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse37))) (select (let ((.cse35 (let ((.cse38 (let ((.cse39 (store |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base) .cse37 c_dll_create_~head~0.base) .cse41 v_prenex_90)))) (store .cse39 c_dll_create_~head~0.base (store (select .cse39 c_dll_create_~head~0.base) .cse40 v_prenex_80))))) (store .cse38 v_prenex_73 (store (select .cse38 v_prenex_73) v_prenex_74 c_dll_create_~new_head~0.base))))) (let ((.cse34 (select (select .cse35 c_dll_create_~new_head~0.base) .cse37))) (select (let ((.cse33 (store .cse35 .cse34 (store (select .cse35 .cse34) (+ .cse36 8) v_prenex_72)))) (store .cse33 v_prenex_73 (store (select .cse33 v_prenex_73) v_prenex_74 .cse34))) .cse34))) (+ .cse36 4))))) (= (select |c_old(#valid)| v_prenex_73) 0))) (forall ((v_prenex_89 Int) (v_prenex_88 Int) (v_prenex_63 Int) (v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (or (= 4 v_prenex_64) (= (let ((.cse51 (+ c_dll_create_~head~0.offset 8)) (.cse52 (+ c_dll_create_~new_head~0.offset 8)) (.cse48 (+ c_dll_create_~new_head~0.offset 4))) (let ((.cse47 (select (select (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.offset| c_dll_create_~new_head~0.base) .cse48 c_dll_create_~head~0.offset) .cse52 v_prenex_88)))) (store .cse54 c_dll_create_~head~0.base (store (select .cse54 c_dll_create_~head~0.base) .cse51 v_prenex_85))))) (store .cse53 v_prenex_63 (store (select .cse53 v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.offset))) c_dll_create_~new_head~0.base) .cse48))) (select (let ((.cse46 (let ((.cse49 (let ((.cse50 (store |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base (store (store (select |c_#memory_$Pointer$.base| c_dll_create_~new_head~0.base) .cse48 c_dll_create_~head~0.base) .cse52 v_prenex_89)))) (store .cse50 c_dll_create_~head~0.base (store (select .cse50 c_dll_create_~head~0.base) .cse51 v_prenex_84))))) (store .cse49 v_prenex_63 (store (select .cse49 v_prenex_63) v_prenex_64 c_dll_create_~new_head~0.base))))) (let ((.cse45 (select (select .cse46 c_dll_create_~new_head~0.base) .cse48))) (select (let ((.cse44 (store .cse46 .cse45 (store (select .cse46 .cse45) (+ .cse47 8) v_prenex_62)))) (store .cse44 v_prenex_63 (store (select .cse44 v_prenex_63) v_prenex_64 .cse45))) .cse45))) (+ .cse47 4)))) 0)))) is different from false [2018-11-10 01:48:31,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 01:48:37,855 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2018-11-10 01:48:37,863 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 01:48:37,876 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 01:48:43,297 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2018-11-10 01:48:43,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 01:50:34,282 WARN L179 SmtUtils]: Spent 1.85 m on a formula simplification. DAG size of input: 499 DAG size of output: 314 [2018-11-10 01:50:34,293 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 2321 treesize of output 1657 [2018-11-10 01:50:34,426 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-10 01:50:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1269 treesize of output 1172 [2018-11-10 01:50:34,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,442 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 1169 treesize of output 1117 [2018-11-10 01:50:34,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2795 treesize of output 2498 [2018-11-10 01:50:34,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,501 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 2498 treesize of output 2326 [2018-11-10 01:50:34,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1550 treesize of output 1353 [2018-11-10 01:50:34,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,594 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 1349 treesize of output 1237 [2018-11-10 01:50:34,594 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,621 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:34,750 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 1234 treesize of output 982 [2018-11-10 01:50:34,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,857 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 4 case distinctions, treesize of input 932 treesize of output 896 [2018-11-10 01:50:34,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:34,870 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 880 treesize of output 873 [2018-11-10 01:50:34,871 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:35,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:35,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:35,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 873 treesize of output 859 [2018-11-10 01:50:35,076 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:35,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:35,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 875 treesize of output 881 [2018-11-10 01:50:35,244 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-10 01:50:35,486 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:50:35,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:35,599 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 4 case distinctions, treesize of input 1737 treesize of output 1671 [2018-11-10 01:50:35,605 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:35,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:35,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1655 treesize of output 1631 [2018-11-10 01:50:35,618 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:36,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:36,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 1650 treesize of output 1646 [2018-11-10 01:50:36,211 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-11-10 01:50:36,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:36,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:36,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1648 treesize of output 1631 [2018-11-10 01:50:36,479 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:36,663 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:50:36,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:36,742 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 4 case distinctions, treesize of input 841 treesize of output 835 [2018-11-10 01:50:36,746 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:50:36,746 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:36,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:36,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:36,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 812 treesize of output 808 [2018-11-10 01:50:36,857 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:36,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 814 treesize of output 830 [2018-11-10 01:50:37,031 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-11-10 01:50:37,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,189 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 812 treesize of output 815 [2018-11-10 01:50:37,190 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:37,332 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:50:37,583 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 856 treesize of output 745 [2018-11-10 01:50:37,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:37,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 689 treesize of output 690 [2018-11-10 01:50:37,697 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:37,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 662 treesize of output 644 [2018-11-10 01:50:38,110 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 119 [2018-11-10 01:50:38,113 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,113 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,114 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,115 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:38,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 432 treesize of output 503 [2018-11-10 01:50:38,141 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-11-10 01:50:38,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:38,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 417 treesize of output 1036 [2018-11-10 01:50:38,393 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 01:50:38,405 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:50:38,405 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:39,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:39,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:39,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:39,975 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:50:39,976 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_156 term size 76 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) 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-10 01:50:39,979 INFO L168 Benchmark]: Toolchain (without parser) took 169589.76 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.9 MB). Free memory was 951.8 MB in the beginning and 978.2 MB in the end (delta: -26.4 MB). Peak memory consumption was 530.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,979 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:50:39,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -273.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,980 INFO L168 Benchmark]: Boogie Preprocessor took 22.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,980 INFO L168 Benchmark]: RCFGBuilder took 308.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,981 INFO L168 Benchmark]: TraceAbstraction took 168832.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 253.8 MB). Free memory was 1.2 GB in the beginning and 978.2 MB in the end (delta: 194.8 MB). Peak memory consumption was 543.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:50:39,983 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -273.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168832.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 253.8 MB). Free memory was 1.2 GB in the beginning and 978.2 MB in the end (delta: 194.8 MB). Peak memory consumption was 543.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_156 term size 76 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_156 term size 76: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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-10 01:50:41,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:50:41,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:50:41,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:50:41,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:50:41,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:50:41,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:50:41,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:50:41,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:50:41,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:50:41,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:50:41,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:50:41,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:50:41,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:50:41,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:50:41,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:50:41,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:50:41,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:50:41,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:50:41,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:50:41,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:50:41,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:50:41,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:50:41,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:50:41,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:50:41,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:50:41,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:50:41,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:50:41,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:50:41,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:50:41,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:50:41,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:50:41,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:50:41,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:50:41,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:50:41,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:50:41,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 01:50:41,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:50:41,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:50:41,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:50:41,644 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:50:41,644 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:50:41,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:50:41,644 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:50:41,644 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:50:41,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:50:41,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:50:41,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 01:50:41,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:50:41,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:50:41,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:50:41,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 01:50:41,648 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 01:50:41,648 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_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan 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 -> Taipan 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 -> 2bb752e40b61404db64f5779eae1f3ed9be1fbd7 [2018-11-10 01:50:41,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:50:41,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:50:41,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:50:41,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:50:41,695 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:50:41,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:50:41,736 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/19299336c/c007d33c95304380b64eb4d2e0f97d4f/FLAGd63fcecbd [2018-11-10 01:50:42,125 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:50:42,126 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:50:42,137 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/19299336c/c007d33c95304380b64eb4d2e0f97d4f/FLAGd63fcecbd [2018-11-10 01:50:42,148 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/data/19299336c/c007d33c95304380b64eb4d2e0f97d4f [2018-11-10 01:50:42,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:50:42,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:50:42,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:50:42,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:50:42,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:50:42,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36796db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42, skipping insertion in model container [2018-11-10 01:50:42,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:50:42,207 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:50:42,453 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:50:42,466 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:50:42,511 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:50:42,554 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:50:42,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42 WrapperNode [2018-11-10 01:50:42,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:50:42,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:50:42,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:50:42,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:50:42,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:50:42,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:50:42,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:50:42,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:50:42,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... [2018-11-10 01:50:42,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:50:42,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:50:42,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:50:42,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:50:42,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:50:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 01:50:42,708 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 01:50:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-11-10 01:50:42,709 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-11-10 01:50:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:50:42,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:50:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:50:42,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:50:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-10 01:50:42,710 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-10 01:50:42,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:50:42,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:50:43,032 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:50:43,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:50:43 BoogieIcfgContainer [2018-11-10 01:50:43,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:50:43,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:50:43,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:50:43,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:50:43,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:50:42" (1/3) ... [2018-11-10 01:50:43,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cb6665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:50:43, skipping insertion in model container [2018-11-10 01:50:43,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:50:42" (2/3) ... [2018-11-10 01:50:43,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cb6665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:50:43, skipping insertion in model container [2018-11-10 01:50:43,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:50:43" (3/3) ... [2018-11-10 01:50:43,040 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 01:50:43,046 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:50:43,052 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:50:43,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:50:43,086 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:50:43,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:50:43,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:50:43,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:50:43,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:50:43,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:50:43,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:50:43,087 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:50:43,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:50:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-10 01:50:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 01:50:43,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:43,106 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:50:43,108 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:43,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash -871676783, now seen corresponding path program 1 times [2018-11-10 01:50:43,116 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/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-10 01:50:43,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:43,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:43,217 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-10 01:50:43,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:50:43,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:43,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:50:43,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:50:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:50:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:50:43,236 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-10 01:50:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:43,255 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-10 01:50:43,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:50:43,256 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-10 01:50:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:43,265 INFO L225 Difference]: With dead ends: 59 [2018-11-10 01:50:43,265 INFO L226 Difference]: Without dead ends: 31 [2018-11-10 01:50:43,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-10 01:50:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-10 01:50:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-10 01:50:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 01:50:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-10 01:50:43,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2018-11-10 01:50:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:43,293 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-10 01:50:43,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:50:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-10 01:50:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 01:50:43,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:43,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] [2018-11-10 01:50:43,295 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:43,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1164667089, now seen corresponding path program 1 times [2018-11-10 01:50:43,296 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:43,296 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/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-10 01:50:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:43,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:43,407 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-10 01:50:43,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:50:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:50:43,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:50:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:50:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:50:43,413 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-10 01:50:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:43,495 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-10 01:50:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:50:43,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 01:50:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:43,498 INFO L225 Difference]: With dead ends: 54 [2018-11-10 01:50:43,498 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 01:50:43,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-10 01:50:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 01:50:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-10 01:50:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 01:50:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-10 01:50:43,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-11-10 01:50:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:43,507 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-10 01:50:43,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:50:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-10 01:50:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 01:50:43,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:43,509 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:50:43,509 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:43,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:43,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2037612763, now seen corresponding path program 1 times [2018-11-10 01:50:43,510 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:43,510 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/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-10 01:50:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:43,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:43,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:50:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:50:43,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:50:43,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:50:43,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:50:43,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:43,615 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-11-10 01:50:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:43,665 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-10 01:50:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:50:43,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 01:50:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:43,667 INFO L225 Difference]: With dead ends: 60 [2018-11-10 01:50:43,667 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 01:50:43,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:50:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 01:50:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 01:50:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 01:50:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-10 01:50:43,673 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2018-11-10 01:50:43,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:43,673 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-10 01:50:43,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:50:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-10 01:50:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 01:50:43,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:43,674 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:50:43,675 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:43,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1670548519, now seen corresponding path program 1 times [2018-11-10 01:50:43,675 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:43,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/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-10 01:50:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:43,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:43,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:50:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:50:43,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:50:43,934 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:50:43,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:43,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:50:44,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:50:44,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:50:44,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-11-10 01:50:44,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:50:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:50:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:50:44,024 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 10 states. [2018-11-10 01:50:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:44,210 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-10 01:50:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:50:44,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-10 01:50:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:44,213 INFO L225 Difference]: With dead ends: 64 [2018-11-10 01:50:44,213 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 01:50:44,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:50:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 01:50:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-10 01:50:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 01:50:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-10 01:50:44,226 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 25 [2018-11-10 01:50:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:44,227 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-10 01:50:44,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-10 01:50:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 01:50:44,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:44,228 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:50:44,228 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:44,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1843696955, now seen corresponding path program 1 times [2018-11-10 01:50:44,231 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:44,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:50:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:44,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:50:44,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:50:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:50:44,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:50:44,469 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:50:44,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:50:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:50:44,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:50:44,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:50:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:50:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:50:44,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-11-10 01:50:44,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:50:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:50:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:50:44,667 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-11-10 01:50:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:50:44,778 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-10 01:50:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:50:44,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-11-10 01:50:44,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:50:44,780 INFO L225 Difference]: With dead ends: 57 [2018-11-10 01:50:44,780 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 01:50:44,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:50:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 01:50:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-10 01:50:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 01:50:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-10 01:50:44,789 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 40 [2018-11-10 01:50:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:50:44,790 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-10 01:50:44,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:50:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-10 01:50:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:50:44,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:50:44,792 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2018-11-10 01:50:44,792 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:50:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:50:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash 398232891, now seen corresponding path program 2 times [2018-11-10 01:50:44,793 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:50:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:50:44,807 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 01:50:45,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:50:45,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:50:45,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:45,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:50:45,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:50:45,286 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 18 treesize of output 15 [2018-11-10 01:50:45,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:45,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,297 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 18 treesize of output 27 [2018-11-10 01:50:45,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,352 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 18 treesize of output 15 [2018-11-10 01:50:45,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:45,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,361 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 18 treesize of output 27 [2018-11-10 01:50:45,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,409 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-11-10 01:50:45,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,528 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 28 treesize of output 29 [2018-11-10 01:50:45,533 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,544 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 18 treesize of output 27 [2018-11-10 01:50:45,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,625 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 28 treesize of output 35 [2018-11-10 01:50:45,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:45,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,639 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 18 treesize of output 27 [2018-11-10 01:50:45,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,700 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:62 [2018-11-10 01:50:45,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,781 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 98 treesize of output 94 [2018-11-10 01:50:45,791 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 20 treesize of output 27 [2018-11-10 01:50:45,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:45,867 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 46 treesize of output 39 [2018-11-10 01:50:45,872 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 20 treesize of output 27 [2018-11-10 01:50:45,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:45,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:64 [2018-11-10 01:50:46,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:46,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:46,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:46,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-10 01:50:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:66 [2018-11-10 01:50:46,216 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 30 treesize of output 47 [2018-11-10 01:50:46,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:50:46,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,272 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 50 treesize of output 54 [2018-11-10 01:50:46,276 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-10 01:50:46,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:46,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:88 [2018-11-10 01:50:46,724 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|dll_remove_first_write~$Pointer$_#value.base| (_ BitVec 32))) (= (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse3 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| .cse2) .cse3))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse2) .cse3) (_ bv8 32)) |dll_remove_first_write~$Pointer$_#value.base|)))) (store .cse0 |c_dll_remove_first_#in~head.base| (store (select .cse0 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse1))))) |c_#memory_$Pointer$.base|)) (exists ((|dll_remove_first_write~$Pointer$_#value.offset| (_ BitVec 32))) (= (let ((.cse7 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse8 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse5 (select (select |c_old(#memory_$Pointer$.offset)| .cse7) .cse8))) (let ((.cse4 (let ((.cse6 (select (select |c_old(#memory_$Pointer$.base)| .cse7) .cse8))) (store |c_old(#memory_$Pointer$.offset)| .cse6 (store (select |c_old(#memory_$Pointer$.offset)| .cse6) (bvadd .cse5 (_ bv8 32)) |dll_remove_first_write~$Pointer$_#value.offset|))))) (store .cse4 |c_dll_remove_first_#in~head.base| (store (select .cse4 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse5))))) |c_#memory_$Pointer$.offset|))) is different from true [2018-11-10 01:50:46,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:47,046 INFO L303 Elim1Store]: Index analysis took 315 ms [2018-11-10 01:50:47,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 251 [2018-11-10 01:50:47,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,081 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 44 treesize of output 79 [2018-11-10 01:50:47,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:47,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,379 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-10 01:50:47,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, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 246 [2018-11-10 01:50:47,391 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 231 [2018-11-10 01:50:47,392 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-10 01:50:47,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:47,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:47,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:47,858 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-11-10 01:50:47,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 177 [2018-11-10 01:50:47,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,877 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 30 treesize of output 51 [2018-11-10 01:50:47,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:47,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:47,975 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:47,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 149 [2018-11-10 01:50:47,983 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 111 treesize of output 92 [2018-11-10 01:50:47,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,015 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,040 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:48,098 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:346, output treesize:83 [2018-11-10 01:50:48,285 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 25 treesize of output 22 [2018-11-10 01:50:48,288 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-10 01:50:48,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,308 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 25 treesize of output 22 [2018-11-10 01:50:48,311 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-10 01:50:48,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-11-10 01:50:48,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:48,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:48,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2018-11-10 01:50:48,445 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:48,446 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 01:50:48,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,467 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 9 treesize of output 1 [2018-11-10 01:50:48,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,484 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 27 treesize of output 23 [2018-11-10 01:50:48,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:48,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:48,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-10 01:50:48,543 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:48,544 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 22 treesize of output 18 [2018-11-10 01:50:48,544 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,563 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 13 treesize of output 9 [2018-11-10 01:50:48,564 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,571 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:48,572 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 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 01:50:48,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,586 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:125, output treesize:18 [2018-11-10 01:50:48,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:50:48,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:50:48,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:50:48,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:50:48,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:48,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-10 01:50:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 1 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-10 01:50:48,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:50:49,128 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 01:50:49,231 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 01:50:49,544 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 47 treesize of output 45 [2018-11-10 01:50:49,547 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 5 treesize of output 3 [2018-11-10 01:50:49,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:49,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:49,561 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 47 treesize of output 45 [2018-11-10 01:50:49,564 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 5 treesize of output 3 [2018-11-10 01:50:49,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:49,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:49,578 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 47 treesize of output 45 [2018-11-10 01:50:49,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-10 01:50:49,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:49,594 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:50,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:50:50,017 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:105, output treesize:161 [2018-11-10 01:50:50,874 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 01:50:51,222 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 01:50:51,758 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-10 01:50:52,310 WARN L179 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-10 01:50:52,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:50:52,768 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:50:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:50:52,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:50:52,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:50:52,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:50:52,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:50:52,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:52,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:52,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 01:50:52,963 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 18 treesize of output 15 [2018-11-10 01:50:52,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:52,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:52,973 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 18 treesize of output 27 [2018-11-10 01:50:52,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:52,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:52,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,019 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 18 treesize of output 15 [2018-11-10 01:50:53,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:53,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,031 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 18 treesize of output 27 [2018-11-10 01:50:53,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,040 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,068 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-11-10 01:50:53,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,098 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 28 treesize of output 29 [2018-11-10 01:50:53,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:53,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,112 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 18 treesize of output 27 [2018-11-10 01:50:53,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,196 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 28 treesize of output 35 [2018-11-10 01:50:53,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:50:53,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,208 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 18 treesize of output 27 [2018-11-10 01:50:53,209 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,272 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:62 [2018-11-10 01:50:53,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,295 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 98 treesize of output 94 [2018-11-10 01:50:53,309 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 20 treesize of output 27 [2018-11-10 01:50:53,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,383 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 46 treesize of output 39 [2018-11-10 01:50:53,390 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 20 treesize of output 27 [2018-11-10 01:50:53,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:64 [2018-11-10 01:50:53,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 01:50:53,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:53 [2018-11-10 01:50:53,601 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 30 treesize of output 47 [2018-11-10 01:50:53,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:50:53,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,656 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 50 treesize of output 54 [2018-11-10 01:50:53,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 01:50:53,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:53,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:85 [2018-11-10 01:50:53,876 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_subst_1 (_ BitVec 32))) (= (let ((.cse3 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse4 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.offset)| .cse3) .cse4))) (let ((.cse0 (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| .cse3) .cse4))) (store |c_old(#memory_$Pointer$.offset)| .cse2 (store (select |c_old(#memory_$Pointer$.offset)| .cse2) (bvadd .cse1 (_ bv8 32)) v_subst_1))))) (store .cse0 |c_dll_remove_first_#in~head.base| (store (select .cse0 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse1))))) |c_#memory_$Pointer$.offset|)) (exists ((|dll_remove_first_write~$Pointer$_#value.base| (_ BitVec 32))) (= (let ((.cse7 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (.cse8 (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) (_ bv4 32)))) (let ((.cse6 (select (select |c_old(#memory_$Pointer$.base)| .cse7) .cse8))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| .cse6 (store (select |c_old(#memory_$Pointer$.base)| .cse6) (bvadd (select (select |c_old(#memory_$Pointer$.offset)| .cse7) .cse8) (_ bv8 32)) |dll_remove_first_write~$Pointer$_#value.base|)))) (store .cse5 |c_dll_remove_first_#in~head.base| (store (select .cse5 |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset| .cse6))))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-10 01:50:53,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:53,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:54,202 INFO L303 Elim1Store]: Index analysis took 319 ms [2018-11-10 01:50:54,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 277 [2018-11-10 01:50:54,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:54,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 67 [2018-11-10 01:50:54,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:54,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:54,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:54,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 226 [2018-11-10 01:50:54,468 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 244 treesize of output 205 [2018-11-10 01:50:54,470 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-10 01:50:54,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:54,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:54,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:55,030 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-11-10 01:50:55,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 154 [2018-11-10 01:50:55,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:55,040 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 30 treesize of output 51 [2018-11-10 01:50:55,041 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:55,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:55,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:50:55,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:50:55,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 130 [2018-11-10 01:50:55,112 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 92 treesize of output 64 [2018-11-10 01:50:55,112 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:50:55,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:55,172 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:50:55,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:50:55,208 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:343, output treesize:72 [2018-11-10 01:50:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-10 01:50:55,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:50:59,242 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-10 01:50:59,595 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 01:51:00,035 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-10 01:51:00,563 WARN L179 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-10 01:51:00,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:51:00,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 31 [2018-11-10 01:51:00,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 01:51:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 01:51:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1158, Unknown=4, NotChecked=138, Total=1406 [2018-11-10 01:51:00,917 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 31 states. [2018-11-10 01:51:04,363 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 01:51:05,800 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-10 01:51:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:51:07,601 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-10 01:51:07,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 01:51:07,604 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-11-10 01:51:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:51:07,607 INFO L225 Difference]: With dead ends: 101 [2018-11-10 01:51:07,607 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 01:51:07,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=193, Invalid=2160, Unknown=7, NotChecked=190, Total=2550 [2018-11-10 01:51:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 01:51:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-10 01:51:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 01:51:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-11-10 01:51:07,622 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 49 [2018-11-10 01:51:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:51:07,623 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-11-10 01:51:07,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 01:51:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-11-10 01:51:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:51:07,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:51:07,625 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-11-10 01:51:07,625 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:51:07,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:51:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1290710851, now seen corresponding path program 1 times [2018-11-10 01:51:07,626 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:51:07,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:51:07,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:51:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:51:07,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:07,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:51:07,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:07,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:07,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:51:07,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 01:51:07,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:51:08,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:08,006 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 18 treesize of output 27 [2018-11-10 01:51:08,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:25 [2018-11-10 01:51:08,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:08,079 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-11-10 01:51:08,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 01:51:08,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,108 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-10 01:51:08,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:28 [2018-11-10 01:51:08,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:08,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 01:51:08,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:31 [2018-11-10 01:51:08,270 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-10 01:51:08,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:51:08,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,299 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 28 treesize of output 29 [2018-11-10 01:51:08,302 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-10 01:51:08,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:08,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2018-11-10 01:51:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:51:08,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:09,255 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-10 01:51:09,375 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 01:51:09,516 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-10 01:51:09,664 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 01:51:09,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:09,757 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-10 01:51:09,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-10 01:51:09,774 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 16 treesize of output 17 [2018-11-10 01:51:09,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:09,818 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-10 01:51:09,858 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-10 01:51:09,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,886 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:09,889 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 25 treesize of output 22 [2018-11-10 01:51:09,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:51:09,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-10 01:51:09,902 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,904 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:09,914 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-10 01:51:09,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:51:09,922 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:89, output treesize:20 [2018-11-10 01:51:09,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:51:09,974 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:51:09,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:51:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:51:10,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:10,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:51:10,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 01:51:10,244 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 18 treesize of output 15 [2018-11-10 01:51:10,246 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:51:10,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:10,252 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 18 treesize of output 27 [2018-11-10 01:51:10,253 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2018-11-10 01:51:10,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:10,367 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 63 [2018-11-10 01:51:10,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 14 treesize of output 13 [2018-11-10 01:51:10,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,403 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-10 01:51:10,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:39 [2018-11-10 01:51:10,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:10,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:10,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:51:10,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 25 [2018-11-10 01:51:10,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-11-10 01:51:10,690 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-10 01:51:10,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:51:10,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-10 01:51:10,721 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-10 01:51:10,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:10,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:56 [2018-11-10 01:51:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:51:10,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:11,472 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-10 01:51:11,578 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 01:51:11,720 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-10 01:51:11,849 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 01:51:11,948 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:11,963 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-10 01:51:11,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2018-11-10 01:51:11,978 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 16 treesize of output 17 [2018-11-10 01:51:11,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:11,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:12,021 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-10 01:51:12,061 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-10 01:51:12,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,090 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:51:12,092 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 25 treesize of output 22 [2018-11-10 01:51:12,096 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-10 01:51:12,096 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,106 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 1 [2018-11-10 01:51:12,106 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,108 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,114 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:51:12,119 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-10 01:51:12,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:51:12,129 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:95, output treesize:20 [2018-11-10 01:51:12,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:51:12,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-11-10 01:51:12,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 01:51:12,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 01:51:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:51:12,209 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 28 states. [2018-11-10 01:51:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:51:14,933 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-11-10 01:51:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 01:51:14,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-11-10 01:51:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:51:14,935 INFO L225 Difference]: With dead ends: 135 [2018-11-10 01:51:14,935 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 01:51:14,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=194, Invalid=1968, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 01:51:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 01:51:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-10 01:51:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 01:51:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-11-10 01:51:14,947 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 49 [2018-11-10 01:51:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:51:14,947 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-11-10 01:51:14,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 01:51:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-11-10 01:51:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 01:51:14,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:51:14,949 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-11-10 01:51:14,949 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:51:14,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:51:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -370667761, now seen corresponding path program 3 times [2018-11-10 01:51:14,950 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:51:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:51:14,984 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 01:51:15,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 01:51:15,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:51:15,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 01:51:16,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 01:51:16,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:51:16,203 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:51:16,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:51:28,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 01:51:28,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:51:28,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 01:51:28,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 01:51:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:51:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9, 9] total 20 [2018-11-10 01:51:29,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 01:51:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 01:51:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:51:29,566 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 20 states. [2018-11-10 01:51:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:51:30,516 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-11-10 01:51:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:51:30,517 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-10 01:51:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:51:30,518 INFO L225 Difference]: With dead ends: 109 [2018-11-10 01:51:30,518 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 01:51:30,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-11-10 01:51:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 01:51:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 01:51:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 01:51:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 01:51:30,530 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 55 [2018-11-10 01:51:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:51:30,531 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 01:51:30,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 01:51:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-10 01:51:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 01:51:30,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:51:30,532 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:51:30,532 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:51:30,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:51:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1063022791, now seen corresponding path program 2 times [2018-11-10 01:51:30,535 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:51:30,535 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:51:30,565 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 01:51:30,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:51:30,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:51:30,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 01:51:30,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 01:51:30,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:51:30,927 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:51:30,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:51:31,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:51:31,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:51:31,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:51:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 01:51:31,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:51:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 01:51:31,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:51:31,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 9] total 18 [2018-11-10 01:51:31,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 01:51:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 01:51:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:51:31,326 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 18 states. [2018-11-10 01:51:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:51:31,391 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-10 01:51:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:51:31,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-10 01:51:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:51:31,391 INFO L225 Difference]: With dead ends: 64 [2018-11-10 01:51:31,391 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 01:51:31,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:51:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 01:51:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 01:51:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 01:51:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 01:51:31,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-11-10 01:51:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:51:31,393 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:51:31,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 01:51:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:51:31,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 01:51:31,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 01:51:31,679 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 01:51:32,112 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-11-10 01:51:32,313 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-11-10 01:51:32,321 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-10 01:51:32,321 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-10 01:51:32,321 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 576 589) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L421 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 01:51:32,322 INFO L421 ceAbstractionStarter]: At program point L576-3(lines 576 589) the Hoare annotation is: (let ((.cse3 (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (let ((.cse10 (bvadd dll_create_~head~0.offset (_ bv4 32))) (.cse7 (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) .cse3)) (.cse0 (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse6 (= (_ bv0 32) dll_create_~new_head~0.offset)) (.cse8 (or (not (bvsgt (bvadd dll_create_~len (_ bv4294967294 32)) (_ bv0 32))) .cse0)) (.cse2 (= (_ bv0 32) dll_create_~head~0.offset)) (.cse1 (= (_ bv0 32) dll_create_~head~0.base)) (.cse5 (= .cse7 (_ bv0 32))) (.cse9 (= (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) .cse10) (_ bv0 32)))) (or .cse0 (and (= |#valid| |old(#valid)|) .cse1 .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_create_~len |dll_create_#in~len|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (let ((.cse4 (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) .cse10))) (and (= (select (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base) .cse3) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse4) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| .cse4) (_ bv4 32)) (_ bv0 32)) (not .cse5) .cse6 (= (select (store |old(#valid)| .cse4 (_ bv1 1)) dll_create_~head~0.base) (_ bv0 1)) (= (select (store |old(#valid)| .cse7 (_ bv1 1)) dll_create_~new_head~0.base) (_ bv0 1)) .cse8 (= (bvadd dll_create_~len (_ bv2 32)) |dll_create_#in~len|) (= (select |old(#valid)| .cse7) (_ bv0 1)) .cse2 (not (= (_ bv0 32) .cse4)) (= (select |old(#valid)| .cse4) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| .cse7) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse7) (_ bv4 32))) .cse9)) (and .cse6 (= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|) .cse8 (= |#valid| (store |old(#valid)| dll_create_~head~0.base (_ bv1 1))) .cse2 (not .cse1) .cse5 .cse9 (= (select |old(#valid)| dll_create_~new_head~0.base) (_ bv0 1)) (= |#valid| (store |old(#valid)| dll_create_~new_head~0.base (_ bv1 1)))))))) [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L576-4(lines 576 589) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L428 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-11-10 01:51:32,322 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 01:51:32,323 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L421 ceAbstractionStarter]: At program point L609(lines 600 614) the Hoare annotation is: false [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 612) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L421 ceAbstractionStarter]: At program point L603(line 603) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point L603-1(line 603) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L421 ceAbstractionStarter]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse0 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse9 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse2) (_ bv4 32)))) (.cse1 (= |main_~#s~0.offset| (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= (_ bv0 32) .cse2) .cse3 (= (_ bv4294967295 32) main_~i~0)) (and (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse8 (select |#memory_$Pointer$.base| v_arrayElimCell_11)) (.cse7 (bvadd |main_~#s~0.offset| (_ bv4 32)))) (let ((.cse4 (select .cse8 .cse7)) (.cse5 (select .cse8 (_ bv4 32))) (.cse6 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) .cse7))) (and (= (select (select |#memory_$Pointer$.base| .cse4) (_ bv4 32)) (_ bv0 32)) (not (= .cse5 v_arrayElimCell_11)) (not (= |main_~#s~0.base| v_arrayElimCell_11)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) .cse6) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) .cse4) (not (= .cse5 |main_~#s~0.base|)) (= .cse6 |main_~#s~0.offset|))))) .cse9 .cse1 (= main_~i~0 (_ bv0 32)) .cse3) (let ((.cse10 (select (select |#memory_$Pointer$.base| .cse2) (_ bv4 32)))) (and (not (= .cse10 (_ bv0 32))) (not (= .cse10 |main_~#s~0.base|)) .cse0 .cse9 .cse1 .cse3 (= (select (select |#memory_$Pointer$.base| .cse10) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| .cse2)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse10) (_ bv4 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 614) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 600 614) no Hoare annotation was computed. [2018-11-10 01:51:32,323 INFO L425 ceAbstractionStarter]: For program point L608(lines 608 610) no Hoare annotation was computed. [2018-11-10 01:51:32,324 INFO L421 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse5 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse9) (_ bv4 32)))) (.cse6 (= |main_~#s~0.offset| (_ bv0 32))) (.cse7 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse4 (select |#memory_$Pointer$.base| v_arrayElimCell_11)) (.cse3 (bvadd |main_~#s~0.offset| (_ bv4 32)))) (let ((.cse0 (select .cse4 .cse3)) (.cse1 (select .cse4 (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) .cse3))) (and (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (not (= .cse1 v_arrayElimCell_11)) (not (= |main_~#s~0.base| v_arrayElimCell_11)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) .cse2) (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) .cse0) (not (= .cse1 |main_~#s~0.base|)) (= .cse2 |main_~#s~0.offset|))))) .cse5 .cse6 (= main_~i~0 (_ bv0 32)) .cse7) (let ((.cse8 (select (select |#memory_$Pointer$.base| .cse9) (_ bv4 32)))) (and (not (= .cse8 (_ bv0 32))) (not (= .cse8 |main_~#s~0.base|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) .cse5 .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| .cse8) (_ bv4 32)) (_ bv0 32)) (not (= |main_~#s~0.base| .cse9)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse8) (_ bv4 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-11-10 01:51:32,324 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 614) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 01:51:32,324 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 605 607) no Hoare annotation was computed. [2018-11-10 01:51:32,324 INFO L425 ceAbstractionStarter]: For program point L594-2(lines 594 596) no Hoare annotation was computed. [2018-11-10 01:51:32,324 INFO L425 ceAbstractionStarter]: For program point dll_remove_firstFINAL(lines 592 599) no Hoare annotation was computed. [2018-11-10 01:51:32,324 INFO L425 ceAbstractionStarter]: For program point dll_remove_firstEXIT(lines 592 599) no Hoare annotation was computed. [2018-11-10 01:51:32,324 INFO L421 ceAbstractionStarter]: At program point dll_remove_firstENTRY(lines 592 599) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 01:51:32,324 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-10 01:51:32,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,332 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,332 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,332 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,333 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,333 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,334 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,335 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,342 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,345 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,345 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,346 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,355 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,359 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,359 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,359 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,370 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,370 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,370 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,370 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,371 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,371 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,371 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,371 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,374 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:51:32 BoogieIcfgContainer [2018-11-10 01:51:32,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:51:32,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:51:32,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:51:32,381 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:51:32,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:50:43" (3/4) ... [2018-11-10 01:51:32,385 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 01:51:32,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 01:51:32,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 01:51:32,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-11-10 01:51:32,393 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 01:51:32,393 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2018-11-10 01:51:32,397 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-11-10 01:51:32,398 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-10 01:51:32,398 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 01:51:32,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32) || (((((\valid == \old(\valid) && 0bv32 == head) && 0bv32 == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && len == \old(len)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || (((((((((((((((#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32 && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]][4bv32]) && #memory_$Pointer$[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]][4bv32] == 0bv32) && !(#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32)) && 0bv32 == new_head) && \old(\valid)[#memory_$Pointer$[head][~bvadd64(head, 4bv32)] := 1bv1][head] == 0bv1) && \old(\valid)[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] := 1bv1][new_head] == 0bv1) && (!~bvsgt32(~bvadd64(len, 4294967294bv32), 0bv32) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32))) && ~bvadd64(len, 2bv32) == \old(len)) && \old(\valid)[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]] == 0bv1) && 0bv32 == head) && !(0bv32 == #memory_$Pointer$[head][~bvadd64(head, 4bv32)])) && \old(\valid)[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]] == 0bv1) && #memory_$Pointer$[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]][4bv32] == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]][4bv32]) && #memory_$Pointer$[head][~bvadd64(head, 4bv32)] == 0bv32)) || (((((((((0bv32 == new_head && ~bvadd64(len, 1bv32) == \old(len)) && (!~bvsgt32(~bvadd64(len, 4294967294bv32), 0bv32) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32))) && \valid == \old(\valid)[head := 1bv1]) && 0bv32 == head) && !(0bv32 == head)) && #memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32) && #memory_$Pointer$[head][~bvadd64(head, 4bv32)] == 0bv32) && \old(\valid)[new_head] == 0bv1) && \valid == \old(\valid)[new_head := 1bv1]) [2018-11-10 01:51:32,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((#memory_$Pointer$[s][s] == 0bv32 && s == 0bv32) && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32) && 4294967295bv32 == i) || (((((\exists v_arrayElimCell_11 : bv32 :: (((((#memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]][4bv32] == 0bv32 && !(#memory_$Pointer$[v_arrayElimCell_11][4bv32] == v_arrayElimCell_11)) && !(s == v_arrayElimCell_11)) && #memory_$Pointer$[s][s] == #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]) && #memory_$Pointer$[s][s] == #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]) && !(#memory_$Pointer$[v_arrayElimCell_11][4bv32] == s)) && #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]) && s == 0bv32) && i == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32)) || (((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == 0bv32) && !(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == s)) && #memory_$Pointer$[s][s] == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32] == 0bv32) && !(s == #memory_$Pointer$[s][s])) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]) && ~bvadd64(i, 4294967295bv32) == 0bv32) [2018-11-10 01:51:32,444 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98bb9e66-ec40-498a-922c-7edf426e4d42/bin-2019/utaipan/witness.graphml [2018-11-10 01:51:32,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:51:32,445 INFO L168 Benchmark]: Toolchain (without parser) took 50292.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 943.3 MB in the beginning and 918.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 348.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,445 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-10 01:51:32,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.15 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,446 INFO L168 Benchmark]: Boogie Preprocessor took 24.33 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,446 INFO L168 Benchmark]: RCFGBuilder took 368.64 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,446 INFO L168 Benchmark]: TraceAbstraction took 49347.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.1 GB in the beginning and 918.3 MB in the end (delta: 163.9 MB). Peak memory consumption was 364.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:51:32,446 INFO L168 Benchmark]: Witness Printer took 62.71 ms. Allocated memory is still 1.4 GB. Free memory is still 918.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:51:32,448 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 401.15 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.33 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.64 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49347.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.1 GB in the beginning and 918.3 MB in the end (delta: 163.9 MB). Peak memory consumption was 364.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.71 ms. Allocated memory is still 1.4 GB. Free memory is still 918.3 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$.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[v_arrayElimCell_11,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_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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[v_arrayElimCell_11,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_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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$.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 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$.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$.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$.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[v_arrayElimCell_11,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_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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[v_arrayElimCell_11,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_arrayElimCell_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,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$.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 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$.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$.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 - 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$.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$.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 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 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$.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$.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$.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$.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$.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 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 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$.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$.base - 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_$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$ - 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$ - 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$ - 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$ - 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$ - 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: 612]: 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: 605]: Loop Invariant [2018-11-10 01:51:32,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,454 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,455 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,456 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,457 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,464 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,465 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,465 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,465 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,474 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,474 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((#memory_$Pointer$[s][s] == 0bv32 && s == 0bv32) && 0bv32 == #memory_$Pointer$[s][s]) && ~bvadd64(len, 4294967294bv32) == 0bv32) && 4294967295bv32 == i) || (((((\exists v_arrayElimCell_11 : bv32 :: (((((#memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]][4bv32] == 0bv32 && !(#memory_$Pointer$[v_arrayElimCell_11][4bv32] == v_arrayElimCell_11)) && !(s == v_arrayElimCell_11)) && #memory_$Pointer$[s][s] == #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]) && #memory_$Pointer$[s][s] == #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)]) && !(#memory_$Pointer$[v_arrayElimCell_11][4bv32] == s)) && #memory_$Pointer$[v_arrayElimCell_11][~bvadd64(s, 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]) && s == 0bv32) && i == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32)) || (((((((((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == 0bv32) && !(#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] == s)) && #memory_$Pointer$[s][s] == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32] == 0bv32) && !(s == #memory_$Pointer$[s][s])) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32]][4bv32]) && ~bvadd64(i, 4294967295bv32) == 0bv32) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2018-11-10 01:51:32,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,475 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,476 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,476 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,476 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,476 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,476 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,478 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 01:51:32,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 01:51:32,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,488 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 01:51:32,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32) || (((((\valid == \old(\valid) && 0bv32 == head) && 0bv32 == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && len == \old(len)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || (((((((((((((((#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32 && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]][4bv32]) && #memory_$Pointer$[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]][4bv32] == 0bv32) && !(#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32)) && 0bv32 == new_head) && \old(\valid)[#memory_$Pointer$[head][~bvadd64(head, 4bv32)] := 1bv1][head] == 0bv1) && \old(\valid)[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] := 1bv1][new_head] == 0bv1) && (!~bvsgt32(~bvadd64(len, 4294967294bv32), 0bv32) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32))) && ~bvadd64(len, 2bv32) == \old(len)) && \old(\valid)[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]] == 0bv1) && 0bv32 == head) && !(0bv32 == #memory_$Pointer$[head][~bvadd64(head, 4bv32)])) && \old(\valid)[#memory_$Pointer$[head][~bvadd64(head, 4bv32)]] == 0bv1) && #memory_$Pointer$[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]][4bv32] == 0bv32) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)]][4bv32]) && #memory_$Pointer$[head][~bvadd64(head, 4bv32)] == 0bv32)) || (((((((((0bv32 == new_head && ~bvadd64(len, 1bv32) == \old(len)) && (!~bvsgt32(~bvadd64(len, 4294967294bv32), 0bv32) || ~bvsgt32(~bvadd64(\old(len), 4294967294bv32), 0bv32))) && \valid == \old(\valid)[head := 1bv1]) && 0bv32 == head) && !(0bv32 == head)) && #memory_$Pointer$[new_head][~bvadd64(new_head, 4bv32)] == 0bv32) && #memory_$Pointer$[head][~bvadd64(head, 4bv32)] == 0bv32) && \old(\valid)[new_head] == 0bv1) && \valid == \old(\valid)[new_head := 1bv1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. SAFE Result, 49.2s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 262 SDslu, 1846 SDs, 0 SdLazy, 1679 SolverSat, 114 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 921 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=6, 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, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 32 PreInvPairs, 42 NumberOfFragments, 714 HoareAnnotationTreeSize, 32 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 14.6s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 631 NumberOfCodeBlocks, 631 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 958 ConstructedInterpolants, 14 QuantifiedInterpolants, 392386 SizeOfPredicates, 280 NumberOfNonLiveVariables, 3546 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 365/584 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...