./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_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:28:50,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:28:50,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:28:50,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:28:50,828 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:28:50,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:28:50,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:28:50,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:28:50,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:28:50,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:28:50,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:28:50,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:28:50,836 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:28:50,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:28:50,838 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:28:50,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:28:50,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:28:50,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:28:50,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:28:50,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:28:50,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:28:50,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:28:50,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:28:50,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:28:50,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:28:50,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:28:50,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:28:50,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:28:50,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:28:50,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:28:50,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:28:50,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:28:50,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:28:50,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:28:50,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:28:50,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:28:50,854 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:28:50,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:28:50,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:28:50,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:28:50,865 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:28:50,865 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:28:50,865 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:28:50,866 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:28:50,866 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:28:50,866 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:28:50,866 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:28:50,866 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:28:50,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:28:50,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:28:50,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:28:50,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:28:50,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:28:50,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:28:50,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:28:50,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:28:50,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:28:50,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:28:50,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:28:50,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:28:50,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:28:50,871 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:28:50,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:28:50,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:28:50,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:28:50,871 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_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:28:50,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:28:50,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:28:50,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:28:50,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:28:50,911 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:28:50,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:28:50,955 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/706d63d7e/a306395b05064b84a8b86d66dcce25df/FLAGa97cb1a72 [2018-10-26 21:28:51,397 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:28:51,398 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:28:51,408 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/706d63d7e/a306395b05064b84a8b86d66dcce25df/FLAGa97cb1a72 [2018-10-26 21:28:51,420 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/706d63d7e/a306395b05064b84a8b86d66dcce25df [2018-10-26 21:28:51,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:28:51,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:28:51,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:28:51,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:28:51,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:28:51,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:51,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138d2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51, skipping insertion in model container [2018-10-26 21:28:51,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:51,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:28:51,482 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:28:51,733 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:28:51,740 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:28:51,774 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:28:51,822 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:28:51,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51 WrapperNode [2018-10-26 21:28:51,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:28:51,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:28:51,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:28:51,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:28:51,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:51,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:51,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:28:51,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:28:51,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:28:51,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:28:52,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... [2018-10-26 21:28:52,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:28:52,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:28:52,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:28:52,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:28:52,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:28:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:28:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:28:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-10-26 21:28:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-10-26 21:28:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:28:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:28:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:28:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:28:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 21:28:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 21:28:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:28:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:28:52,598 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:28:52,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:52 BoogieIcfgContainer [2018-10-26 21:28:52,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:28:52,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:28:52,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:28:52,601 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:28:52,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:28:51" (1/3) ... [2018-10-26 21:28:52,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64528af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:52, skipping insertion in model container [2018-10-26 21:28:52,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:28:51" (2/3) ... [2018-10-26 21:28:52,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64528af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:28:52, skipping insertion in model container [2018-10-26 21:28:52,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:28:52" (3/3) ... [2018-10-26 21:28:52,604 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:28:52,612 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:28:52,619 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:28:52,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:28:52,659 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:28:52,659 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:28:52,659 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:28:52,659 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:28:52,660 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:28:52,660 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:28:52,660 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:28:52,660 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:28:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-26 21:28:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 21:28:52,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:52,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:28:52,694 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:52,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:52,703 INFO L82 PathProgramCache]: Analyzing trace with hash -871676783, now seen corresponding path program 1 times [2018-10-26 21:28:52,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:52,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:52,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:52,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:28:52,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:52,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:28:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:28:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:28:52,864 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-10-26 21:28:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:52,882 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-10-26 21:28:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:28:52,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-26 21:28:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:52,891 INFO L225 Difference]: With dead ends: 59 [2018-10-26 21:28:52,891 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 21:28:52,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:28:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 21:28:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-26 21:28:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-26 21:28:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-10-26 21:28:52,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2018-10-26 21:28:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:52,929 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-10-26 21:28:52,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:28:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-10-26 21:28:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 21:28:52,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:52,930 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-10-26 21:28:52,930 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1164667089, now seen corresponding path program 1 times [2018-10-26 21:28:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:52,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:52,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:28:53,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:53,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:28:53,109 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:53,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:28:53,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:28:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:28:53,111 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-10-26 21:28:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,166 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-10-26 21:28:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:28:53,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-26 21:28:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,169 INFO L225 Difference]: With dead ends: 39 [2018-10-26 21:28:53,169 INFO L226 Difference]: Without dead ends: 35 [2018-10-26 21:28:53,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-26 21:28:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-10-26 21:28:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:28:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-26 21:28:53,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-10-26 21:28:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,183 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-26 21:28:53,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:28:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-26 21:28:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:28:53,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,184 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-10-26 21:28:53,185 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -17064785, now seen corresponding path program 1 times [2018-10-26 21:28:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:28:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:53,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:28:53,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:53,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:53,335 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-10-26 21:28:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,489 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-10-26 21:28:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:28:53,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-26 21:28:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,491 INFO L225 Difference]: With dead ends: 58 [2018-10-26 21:28:53,491 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 21:28:53,491 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-10-26 21:28:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 21:28:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-10-26 21:28:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-26 21:28:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-10-26 21:28:53,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2018-10-26 21:28:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,497 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-10-26 21:28:53,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:28:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-10-26 21:28:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:28:53,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,498 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-10-26 21:28:53,498 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash -355703589, now seen corresponding path program 1 times [2018-10-26 21:28:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:28:53,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:28:53,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:28:53,598 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:53,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:28:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:28:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:28:53,599 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 3 states. [2018-10-26 21:28:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:53,643 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-10-26 21:28:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:28:53,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 21:28:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:53,645 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:28:53,645 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 21:28:53,645 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-10-26 21:28:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 21:28:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-26 21:28:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-26 21:28:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-26 21:28:53,650 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2018-10-26 21:28:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:53,650 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-26 21:28:53,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:28:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-26 21:28:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:28:53,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:53,651 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-10-26 21:28:53,652 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:53,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -136848871, now seen corresponding path program 1 times [2018-10-26 21:28:53,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:53,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:53,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:53,653 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:28:53,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:53,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:28:53,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-26 21:28:53,758 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-10-26 21:28:53,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:28:53,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:28:54,234 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 21:28:54,235 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-10-26 21:28:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:54,252 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 21:28:54,521 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 86.64% of their original sizes. [2018-10-26 21:28:54,521 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 21:28:55,228 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-10-26 21:28:55,228 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 21:28:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:28:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-10-26 21:28:55,229 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:28:55,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:28:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:28:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:28:55,230 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 9 states. [2018-10-26 21:28:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:56,539 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-10-26 21:28:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:28:56,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-26 21:28:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:56,540 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:28:56,540 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 21:28:56,540 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:28:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 21:28:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-26 21:28:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 21:28:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-10-26 21:28:56,553 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2018-10-26 21:28:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:56,553 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-10-26 21:28:56,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:28:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-10-26 21:28:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:28:56,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:56,560 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-10-26 21:28:56,561 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1843696955, now seen corresponding path program 1 times [2018-10-26 21:28:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:56,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:28:56,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:56,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:28:56,669 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-26 21:28:56,670 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-10-26 21:28:56,671 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:28:56,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:28:57,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:28:57,535 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-10-26 21:28:57,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:57,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:28:57,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:28:57,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:28:57,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:57,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:28:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:57,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:28:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:28:57,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:28:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:28:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:28:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-10-26 21:28:58,020 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:28:58,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:28:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:28:58,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:28:58,021 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-10-26 21:28:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:28:58,358 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-10-26 21:28:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:28:58,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-26 21:28:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:28:58,359 INFO L225 Difference]: With dead ends: 52 [2018-10-26 21:28:58,360 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:28:58,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:28:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:28:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-26 21:28:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:28:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-10-26 21:28:58,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 40 [2018-10-26 21:28:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:28:58,369 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-10-26 21:28:58,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:28:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-10-26 21:28:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 21:28:58,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:28:58,371 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-10-26 21:28:58,371 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:28:58,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:28:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash 398232891, now seen corresponding path program 2 times [2018-10-26 21:28:58,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:28:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:28:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:28:58,375 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:28:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:28:59,479 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-10-26 21:29:00,766 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-10-26 21:29:00,941 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-10-26 21:29:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 21:29:01,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:01,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:29:01,124 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:29:01,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:29:01,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:29:01,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:29:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:29:01,144 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:29:01,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 21:29:01,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:29:01,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:29:01,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:29:01,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:29:01,628 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-10-26 21:29:01,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-10-26 21:29:01,656 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:01,658 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-10-26 21:29:01,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,694 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-10-26 21:29:01,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 21:29:01,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:01,704 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-10-26 21:29:01,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:01,748 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2018-10-26 21:29:01,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 21:29:01,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 21:29:01,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:48 [2018-10-26 21:29:02,003 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-10-26 21:29:02,006 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-10-26 21:29:02,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,011 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-10-26 21:29:02,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-10-26 21:29:02,145 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-10-26 21:29:02,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,163 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-10-26 21:29:02,163 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,198 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:59 [2018-10-26 21:29:02,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 90 [2018-10-26 21:29:02,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,281 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-10-26 21:29:02,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,320 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-10-26 21:29:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,324 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-10-26 21:29:02,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:121, output treesize:71 [2018-10-26 21:29:02,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:02,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-26 21:29:02,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:72 [2018-10-26 21:29:02,703 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-10-26 21:29:02,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:29:02,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,745 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-10-26 21:29:02,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:29:02,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:02,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:94 [2018-10-26 21:29:02,995 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-10-26 21:29:03,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,040 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,059 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-10-26 21:29:03,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,066 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-10-26 21:29:03,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,153 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-10-26 21:29:03,156 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-10-26 21:29:03,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,310 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,320 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-10-26 21:29:03,324 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,326 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-10-26 21:29:03,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,349 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,356 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-10-26 21:29:03,359 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-10-26 21:29:03,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:29:03,376 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:29:03,389 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-10-26 21:29:03,405 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-10-26 21:29:03,405 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:352, output treesize:89 [2018-10-26 21:29:03,508 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-10-26 21:29:03,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 21:29:03,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,521 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-10-26 21:29:03,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 21:29:03,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-10-26 21:29:03,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,578 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-10-26 21:29:03,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, 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-10-26 21:29:03,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,606 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,607 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-10-26 21:29:03,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,617 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-10-26 21:29:03,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:03,637 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-10-26 21:29:03,644 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:03,644 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-10-26 21:29:03,644 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,656 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-10-26 21:29:03,656 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,662 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-10-26 21:29:03,662 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,669 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:131, output treesize:18 [2018-10-26 21:29:03,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:29:03,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:29:03,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:29:03,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:29:03,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:03,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-26 21:29:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-10-26 21:29:03,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:29:04,016 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-10-26 21:29:04,018 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-10-26 21:29:04,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,026 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-10-26 21:29:04,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 21:29:04,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,060 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-10-26 21:29:04,080 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-10-26 21:29:04,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,108 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:04,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:29:04,155 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:105, output treesize:161 [2018-10-26 21:29:08,370 WARN L179 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-26 21:29:08,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 21:29:09,713 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-10-26 21:29:09,819 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-10-26 21:29:09,972 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-10-26 21:29:10,132 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-10-26 21:29:10,295 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 69 [2018-10-26 21:29:10,299 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,311 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-10-26 21:29:10,370 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-10-26 21:29:10,379 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-10-26 21:29:10,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,421 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-10-26 21:29:10,426 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-10-26 21:29:10,432 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-10-26 21:29:10,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,462 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,468 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-10-26 21:29:10,576 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-10-26 21:29:10,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:10,619 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,620 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,627 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,628 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-10-26 21:29:10,634 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:10,654 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-10-26 21:29:10,657 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 21:29:10,703 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,703 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,704 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,706 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-10-26 21:29:10,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:10,798 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-10-26 21:29:10,800 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 21:29:10,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,861 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-10-26 21:29:10,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:10,889 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-10-26 21:29:10,891 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-10-26 21:29:10,916 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:10,916 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,919 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-10-26 21:29:10,919 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,926 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:10,928 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,929 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-10-26 21:29:10,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:10,961 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-10-26 21:29:10,971 INFO L267 ElimStorePlain]: Start of recursive call 18: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 31 xjuncts. [2018-10-26 21:29:11,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:11,060 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-10-26 21:29:11,061 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-10-26 21:29:11,066 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:11,086 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-10-26 21:29:11,086 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-26 21:29:11,144 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:29:11,147 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,147 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,148 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-10-26 21:29:11,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,226 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-10-26 21:29:11,232 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 15 xjuncts. [2018-10-26 21:29:11,262 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,265 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:11,268 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-10-26 21:29:11,268 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,277 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,305 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:29:11,312 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,315 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,317 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,318 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-10-26 21:29:11,324 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-10-26 21:29:11,324 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,344 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,345 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,346 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,348 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-10-26 21:29:11,402 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:11,409 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-10-26 21:29:11,409 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,424 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,425 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-10-26 21:29:11,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:29:11,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:29:11,454 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-10-26 21:29:11,457 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-10-26 21:29:11,479 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-10-26 21:29:11,480 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,482 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,484 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,488 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:29:11,497 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:29:11,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:29:11,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:29:11,541 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-10-26 21:29:11,541 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 22 variables, input treesize:4235, output treesize:47 [2018-10-26 21:29:14,034 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_59 Int) (|v_dll_remove_first_write~$Pointer$_#value.base_17| Int) (v_prenex_60 Int)) (or (= 0 (let ((.cse4 (+ |c_dll_create_#res.offset| 4))) (let ((.cse3 (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_#res.offset|)) |c_dll_create_#res.base|) .cse4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| v_prenex_59 (store (select |c_#memory_$Pointer$.base| v_prenex_59) v_prenex_60 |c_dll_create_#res.base|)))) (let ((.cse1 (select (select .cse2 |c_dll_create_#res.base|) .cse4))) (select (let ((.cse0 (store .cse2 .cse1 (store (select .cse2 .cse1) (+ .cse3 8) |v_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse0 v_prenex_59 (store (select .cse0 v_prenex_59) v_prenex_60 .cse1))) .cse1))) (+ .cse3 4))))) (exists ((v_prenex_61 Int)) (= (select (store |c_old(#valid)| v_prenex_59 1) v_prenex_61) 0)))) (forall ((v_prenex_70 Int) (v_prenex_71 Int)) (= 0 (let ((.cse9 (+ |c_dll_create_#res.offset| 4))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| 0 (store (select |c_#memory_$Pointer$.offset| 0) v_prenex_71 |c_dll_create_#res.offset|)) |c_dll_create_#res.base|) .cse9))) (select (let ((.cse7 (store |c_#memory_$Pointer$.base| 0 (store (select |c_#memory_$Pointer$.base| 0) v_prenex_71 |c_dll_create_#res.base|)))) (let ((.cse6 (select (select .cse7 |c_dll_create_#res.base|) .cse9))) (select (let ((.cse5 (store .cse7 .cse6 (store (select .cse7 .cse6) (+ .cse8 8) v_prenex_70)))) (store .cse5 0 (store (select .cse5 0) v_prenex_71 .cse6))) .cse6))) (+ .cse8 4)))))) (forall ((v_prenex_67 Int) (v_prenex_66 Int) (v_prenex_65 Int)) (or (= 0 (let ((.cse12 (store |c_#memory_$Pointer$.offset| v_prenex_66 (store (select |c_#memory_$Pointer$.offset| v_prenex_66) v_prenex_67 |c_dll_create_#res.offset|))) (.cse14 (+ |c_dll_create_#res.offset| 4))) (let ((.cse11 (select (select .cse12 |c_dll_create_#res.base|) .cse14))) (select (let ((.cse13 (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_#res.base|)) |c_dll_create_#res.base|) .cse14))) (select (let ((.cse10 (store .cse12 .cse13 (store (select .cse12 .cse13) (+ .cse11 8) v_prenex_65)))) (store .cse10 v_prenex_66 (store (select .cse10 v_prenex_66) v_prenex_67 .cse11))) .cse13)) (+ .cse11 4))))) (= 4 v_prenex_67))) (forall ((v_prenex_69 Int) (v_prenex_68 Int)) (= 0 (let ((.cse17 (store |c_#memory_$Pointer$.offset| 0 (store (select |c_#memory_$Pointer$.offset| 0) v_prenex_69 |c_dll_create_#res.offset|))) (.cse19 (+ |c_dll_create_#res.offset| 4))) (let ((.cse16 (select (select .cse17 |c_dll_create_#res.base|) .cse19))) (select (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| 0 (store (select |c_#memory_$Pointer$.base| 0) v_prenex_69 |c_dll_create_#res.base|)) |c_dll_create_#res.base|) .cse19))) (select (let ((.cse15 (store .cse17 .cse18 (store (select .cse17 .cse18) (+ .cse16 8) v_prenex_68)))) (store .cse15 0 (store (select .cse15 0) v_prenex_69 .cse16))) .cse18)) (+ .cse16 4)))))) (forall ((v_prenex_77 Int) (v_prenex_76 Int) (v_prenex_75 Int)) (or (= (select |c_old(#valid)| v_prenex_76) 0) (= 0 (let ((.cse22 (store |c_#memory_$Pointer$.offset| v_prenex_76 (store (select |c_#memory_$Pointer$.offset| v_prenex_76) v_prenex_77 |c_dll_create_#res.offset|))) (.cse24 (+ |c_dll_create_#res.offset| 4))) (let ((.cse21 (select (select .cse22 |c_dll_create_#res.base|) .cse24))) (select (let ((.cse23 (select (select (store |c_#memory_$Pointer$.base| v_prenex_76 (store (select |c_#memory_$Pointer$.base| v_prenex_76) v_prenex_77 |c_dll_create_#res.base|)) |c_dll_create_#res.base|) .cse24))) (select (let ((.cse20 (store .cse22 .cse23 (store (select .cse22 .cse23) (+ .cse21 8) v_prenex_75)))) (store .cse20 v_prenex_76 (store (select .cse20 v_prenex_76) v_prenex_77 .cse21))) .cse23)) (+ .cse21 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 ((.cse27 (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_#res.offset|))) (.cse29 (+ |c_dll_create_#res.offset| 4))) (let ((.cse26 (select (select .cse27 |c_dll_create_#res.base|) .cse29))) (select (let ((.cse28 (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_#res.base|)) |c_dll_create_#res.base|) .cse29))) (select (let ((.cse25 (store .cse27 .cse28 (store (select .cse27 .cse28) (+ .cse26 8) |v_dll_remove_first_write~$Pointer$_#value.offset_17|)))) (store .cse25 |v_main_~#s~0.base_BEFORE_CALL_6| (store (select .cse25 |v_main_~#s~0.base_BEFORE_CALL_6|) |v_main_~#s~0.offset_BEFORE_CALL_6| .cse26))) .cse28)) (+ .cse26 4)))))))) (forall ((v_prenex_63 Int) (v_prenex_62 Int) (v_prenex_64 Int)) (or (= 4 v_prenex_64) (= 0 (let ((.cse34 (+ |c_dll_create_#res.offset| 4))) (let ((.cse33 (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_#res.offset|)) |c_dll_create_#res.base|) .cse34))) (select (let ((.cse32 (store |c_#memory_$Pointer$.base| v_prenex_63 (store (select |c_#memory_$Pointer$.base| v_prenex_63) v_prenex_64 |c_dll_create_#res.base|)))) (let ((.cse31 (select (select .cse32 |c_dll_create_#res.base|) .cse34))) (select (let ((.cse30 (store .cse32 .cse31 (store (select .cse32 .cse31) (+ .cse33 8) v_prenex_62)))) (store .cse30 v_prenex_63 (store (select .cse30 v_prenex_63) v_prenex_64 .cse31))) .cse31))) (+ .cse33 4))))))) (forall ((v_prenex_74 Int) (v_prenex_73 Int) (v_prenex_72 Int)) (or (= (select |c_old(#valid)| v_prenex_73) 0) (= 0 (let ((.cse39 (+ |c_dll_create_#res.offset| 4))) (let ((.cse38 (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_#res.offset|)) |c_dll_create_#res.base|) .cse39))) (select (let ((.cse37 (store |c_#memory_$Pointer$.base| v_prenex_73 (store (select |c_#memory_$Pointer$.base| v_prenex_73) v_prenex_74 |c_dll_create_#res.base|)))) (let ((.cse36 (select (select .cse37 |c_dll_create_#res.base|) .cse39))) (select (let ((.cse35 (store .cse37 .cse36 (store (select .cse37 .cse36) (+ .cse38 8) v_prenex_72)))) (store .cse35 v_prenex_73 (store (select .cse35 v_prenex_73) v_prenex_74 .cse36))) .cse36))) (+ .cse38 4)))))))) is different from false [2018-10-26 21:29:51,004 WARN L179 SmtUtils]: Spent 19.95 s on a formula simplification. DAG size of input: 230 DAG size of output: 153 [2018-10-26 21:30:28,301 WARN L179 SmtUtils]: Spent 11.04 s on a formula simplification that was a NOOP. DAG size: 153 [2018-10-26 21:30:30,341 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_85 Int) (v_prenex_84 Int)) (= 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_85)))) (store .cse7 0 (store (select .cse7 0) v_prenex_69 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_84)))) (store .cse4 0 (store (select .cse4 0) v_prenex_69 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_68)))) (store .cse0 0 (store (select .cse0 0) v_prenex_69 .cse1))) .cse3)) (+ .cse1 4))))))) (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 ((.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_79)))) (store .cse15 v_prenex_59 (store (select .cse15 v_prenex_59) v_prenex_60 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_78)))) (store .cse13 v_prenex_59 (store (select .cse13 v_prenex_59) v_prenex_60 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_dll_remove_first_write~$Pointer$_#value.base_17|)))) (store .cse8 v_prenex_59 (store (select .cse8 v_prenex_59) v_prenex_60 .cse9))) .cse9))) (+ .cse11 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) (v_prenex_83 Int) (v_prenex_82 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_83)))) (store .cse23 v_prenex_63 (store (select .cse23 v_prenex_63) v_prenex_64 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_82)))) (store .cse21 v_prenex_63 (store (select .cse21 v_prenex_63) v_prenex_64 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_prenex_62)))) (store .cse16 v_prenex_63 (store (select .cse16 v_prenex_63) v_prenex_64 .cse17))) .cse17))) (+ .cse19 4))))) (= 4 v_prenex_64))) (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-10-26 21:30:32,420 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_69 Int) (v_prenex_68 Int) (v_prenex_85 Int) (v_prenex_84 Int) (v_prenex_92 Int) (v_prenex_93 Int)) (= 0 (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_85))))) (store .cse9 0 (store (select .cse9 0) v_prenex_69 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_84))))) (store .cse4 0 (store (select .cse4 0) v_prenex_69 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_68)))) (store .cse0 0 (store (select .cse0 0) v_prenex_69 .cse1))) .cse3)) (+ .cse1 4))))))) (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_62 Int) (v_prenex_64 Int) (v_prenex_83 Int) (v_prenex_82 Int)) (or (= (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_83))))) (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_82))))) (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) (= 4 v_prenex_64)))) is different from false [2018-10-26 21:30:32,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 21:30:51,721 WARN L179 SmtUtils]: Spent 8.25 s on a formula simplification that was a NOOP. DAG size: 265 [2018-10-26 21:30:51,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 21:30:51,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 21:31:11,446 WARN L179 SmtUtils]: Spent 8.57 s on a formula simplification that was a NOOP. DAG size: 265 [2018-10-26 21:31:11,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 21:32:48,205 WARN L179 SmtUtils]: Spent 1.61 m on a formula simplification. DAG size of input: 497 DAG size of output: 312 [2018-10-26 21:32:48,217 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-10-26 21:32:48,335 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-26 21:32:48,341 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-10-26 21:32:48,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,351 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-10-26 21:32:48,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,383 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-10-26 21:32:48,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,406 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-10-26 21:32:48,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,467 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-10-26 21:32:48,471 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,474 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-10-26 21:32:48,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,504 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,631 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-10-26 21:32:48,711 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,772 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-10-26 21:32:48,786 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,787 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,795 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-10-26 21:32:48,795 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:48,990 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:48,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:32:49,002 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-10-26 21:32:49,003 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:49,144 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:49,223 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-10-26 21:32:49,225 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-10-26 21:32:49,591 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:32:49,595 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:49,687 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-10-26 21:32:49,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:49,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:32:49,703 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-10-26 21:32:49,704 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:50,271 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:50,394 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-10-26 21:32:50,395 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-26 21:32:50,750 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:50,751 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:50,763 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-10-26 21:32:50,763 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:50,978 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:32:50,982 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:51,038 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-10-26 21:32:51,042 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 21:32:51,042 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:51,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:51,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:32:51,175 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-10-26 21:32:51,176 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:51,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:51,385 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-10-26 21:32:51,386 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-10-26 21:32:51,560 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:51,561 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:51,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-26 21:32:51,569 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:51,710 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:32:52,060 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-10-26 21:32:52,164 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2018-10-26 21:32:52,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,170 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:32:52,181 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-10-26 21:32:52,181 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:52,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, 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-10-26 21:32:52,716 WARN L179 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 119 [2018-10-26 21:32:52,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,726 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:32:52,728 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,763 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-10-26 21:32:52,765 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-10-26 21:32:52,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:52,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:53,124 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-10-26 21:32:53,125 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 21:32:53,168 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 21:32:53,168 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 21:32:54,854 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:54,854 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:54,858 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:32:55,094 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:32:55,095 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-10-26 21:32:55,098 INFO L168 Benchmark]: Toolchain (without parser) took 243674.22 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.2 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -198.3 MB). Peak memory consumption was 589.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,098 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:32:55,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -258.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,099 INFO L168 Benchmark]: Boogie Preprocessor took 35.70 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,099 INFO L168 Benchmark]: RCFGBuilder took 567.52 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,112 INFO L168 Benchmark]: TraceAbstraction took 242497.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 591.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:32:55,113 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 935.6 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 171.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -258.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.70 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 567.52 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.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 242497.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 591.3 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-10-26 21:32:57,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:32:57,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:32:57,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:32:57,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:32:57,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:32:57,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:32:57,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:32:57,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:32:57,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:32:57,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:32:57,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:32:57,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:32:57,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:32:57,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:32:57,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:32:57,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:32:57,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:32:57,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:32:57,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:32:57,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:32:57,083 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:32:57,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:32:57,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:32:57,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:32:57,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:32:57,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:32:57,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:32:57,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:32:57,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:32:57,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:32:57,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:32:57,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:32:57,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:32:57,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:32:57,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:32:57,094 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 21:32:57,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:32:57,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:32:57,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:32:57,113 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:32:57,113 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:32:57,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:32:57,113 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:32:57,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:32:57,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:32:57,114 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:32:57,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:32:57,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:32:57,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:32:57,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:32:57,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:32:57,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:32:57,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:32:57,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:32:57,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:32:57,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:32:57,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:32:57,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:32:57,117 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 21:32:57,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:32:57,117 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 21:32:57,117 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 21:32:57,117 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_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:32:57,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:32:57,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:32:57,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:32:57,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:32:57,174 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:32:57,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:32:57,235 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/14fa93eb7/cc707760125a45e4b7aa9a43efe66560/FLAGde679dc09 [2018-10-26 21:32:57,699 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:32:57,700 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:32:57,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/14fa93eb7/cc707760125a45e4b7aa9a43efe66560/FLAGde679dc09 [2018-10-26 21:32:57,728 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/data/14fa93eb7/cc707760125a45e4b7aa9a43efe66560 [2018-10-26 21:32:57,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:32:57,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:32:57,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:32:57,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:32:57,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:32:57,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:32:57" (1/1) ... [2018-10-26 21:32:57,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e9e58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:57, skipping insertion in model container [2018-10-26 21:32:57,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:32:57" (1/1) ... [2018-10-26 21:32:57,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:32:57,806 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:32:58,190 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:32:58,205 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:32:58,249 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:32:58,295 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:32:58,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58 WrapperNode [2018-10-26 21:32:58,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:32:58,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:32:58,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:32:58,297 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:32:58,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:32:58,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:32:58,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:32:58,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:32:58,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... [2018-10-26 21:32:58,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:32:58,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:32:58,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:32:58,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:32:58,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:32:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:32:58,500 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:32:58,500 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-10-26 21:32:58,501 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-10-26 21:32:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:32:58,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:32:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:32:58,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:32:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-10-26 21:32:58,501 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-10-26 21:32:58,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:32:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:32:59,043 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:32:59,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:32:59 BoogieIcfgContainer [2018-10-26 21:32:59,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:32:59,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:32:59,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:32:59,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:32:59,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:32:57" (1/3) ... [2018-10-26 21:32:59,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955aabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:32:59, skipping insertion in model container [2018-10-26 21:32:59,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:32:58" (2/3) ... [2018-10-26 21:32:59,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955aabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:32:59, skipping insertion in model container [2018-10-26 21:32:59,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:32:59" (3/3) ... [2018-10-26 21:32:59,053 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:32:59,063 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:32:59,075 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:32:59,088 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:32:59,114 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:32:59,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:32:59,115 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:32:59,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:32:59,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:32:59,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:32:59,115 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:32:59,116 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:32:59,116 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:32:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-26 21:32:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-26 21:32:59,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:59,138 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:32:59,141 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash -871676783, now seen corresponding path program 1 times [2018-10-26 21:32:59,154 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:32:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:32:59,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:32:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:59,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:32:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:32:59,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:32:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:32:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:32:59,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:32:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:32:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:32:59,287 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-10-26 21:32:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:32:59,303 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-10-26 21:32:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:32:59,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-26 21:32:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:32:59,316 INFO L225 Difference]: With dead ends: 59 [2018-10-26 21:32:59,317 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 21:32:59,320 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-10-26 21:32:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 21:32:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-26 21:32:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-26 21:32:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-10-26 21:32:59,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2018-10-26 21:32:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:32:59,358 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-10-26 21:32:59,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:32:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-10-26 21:32:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 21:32:59,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:59,360 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-10-26 21:32:59,360 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:59,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1164667089, now seen corresponding path program 1 times [2018-10-26 21:32:59,361 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:32:59,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:32:59,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:32:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:59,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:32:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:32:59,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:32:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:32:59,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:32:59,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:32:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:32:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:32:59,627 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-10-26 21:32:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:32:59,743 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-10-26 21:32:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:32:59,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-26 21:32:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:32:59,745 INFO L225 Difference]: With dead ends: 54 [2018-10-26 21:32:59,745 INFO L226 Difference]: Without dead ends: 37 [2018-10-26 21:32:59,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:32:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-26 21:32:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-10-26 21:32:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:32:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-26 21:32:59,752 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 19 [2018-10-26 21:32:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:32:59,752 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-26 21:32:59,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:32:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-26 21:32:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:32:59,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:32:59,753 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-10-26 21:32:59,753 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:32:59,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:32:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2037612763, now seen corresponding path program 1 times [2018-10-26 21:32:59,754 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:32:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:32:59,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:32:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:32:59,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:32:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:32:59,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:32:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:32:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:32:59,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:32:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:32:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:32:59,890 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-10-26 21:33:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:00,009 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-10-26 21:33:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:33:00,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 21:33:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:00,010 INFO L225 Difference]: With dead ends: 60 [2018-10-26 21:33:00,011 INFO L226 Difference]: Without dead ends: 37 [2018-10-26 21:33:00,012 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-10-26 21:33:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-26 21:33:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-26 21:33:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 21:33:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-10-26 21:33:00,018 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 25 [2018-10-26 21:33:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:00,019 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-10-26 21:33:00,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:33:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-10-26 21:33:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:33:00,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:00,020 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-10-26 21:33:00,020 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:00,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1670548519, now seen corresponding path program 1 times [2018-10-26 21:33:00,021 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:00,021 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:00,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:33:00,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:33:00,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:00,476 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:00,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:33:00,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:33:00,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:33:00,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-10-26 21:33:00,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:33:00,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:33:00,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:33:00,777 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 10 states. [2018-10-26 21:33:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:01,172 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-10-26 21:33:01,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:33:01,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-10-26 21:33:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:01,177 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:33:01,177 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 21:33:01,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:33:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 21:33:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-10-26 21:33:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 21:33:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-26 21:33:01,191 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 25 [2018-10-26 21:33:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:01,192 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-26 21:33:01,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:33:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-26 21:33:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:33:01,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:01,193 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-10-26 21:33:01,193 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:01,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1843696955, now seen corresponding path program 1 times [2018-10-26 21:33:01,194 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:01,194 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:01,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:01,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:33:01,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:33:01,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:01,485 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:01,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:01,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:33:01,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 21:33:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 21:33:01,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-10-26 21:33:01,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:33:01,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:33:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:33:01,796 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-10-26 21:33:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:01,976 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-10-26 21:33:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:33:01,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-10-26 21:33:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:01,978 INFO L225 Difference]: With dead ends: 57 [2018-10-26 21:33:01,978 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 21:33:01,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:33:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 21:33:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-26 21:33:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 21:33:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-10-26 21:33:01,989 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 40 [2018-10-26 21:33:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:01,990 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-10-26 21:33:01,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:33:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-10-26 21:33:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 21:33:01,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:01,993 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-10-26 21:33:01,993 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:01,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 398232891, now seen corresponding path program 2 times [2018-10-26 21:33:01,994 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:01,994 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:02,008 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 21:33:02,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:33:02,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:02,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:02,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:33:02,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:33:02,526 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-10-26 21:33:02,529 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-10-26 21:33:02,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:02,567 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-10-26 21:33:02,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,619 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-10-26 21:33:02,623 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-10-26 21:33:02,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:02,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 21:33:02,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,731 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-10-26 21:33:02,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:02,914 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-10-26 21:33:02,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10-26 21:33:02,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:02,932 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-10-26 21:33:02,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:02,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,044 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,054 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-10-26 21:33:03,059 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-10-26 21:33:03,070 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,073 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-10-26 21:33:03,073 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,154 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:62 [2018-10-26 21:33:03,266 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,281 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-10-26 21:33:03,298 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-10-26 21:33:03,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,362 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,371 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-10-26 21:33:03,400 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-10-26 21:33:03,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:64 [2018-10-26 21:33:03,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:03,673 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-10-26 21:33:03,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:66 [2018-10-26 21:33:03,797 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-10-26 21:33:03,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:03,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,856 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-10-26 21:33:03,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:03,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:03,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:88 [2018-10-26 21:33:04,415 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-10-26 21:33:04,485 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:04,816 INFO L303 Elim1Store]: Index analysis took 393 ms [2018-10-26 21:33:04,817 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-10-26 21:33:04,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:04,850 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-10-26 21:33:04,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:05,048 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,143 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-10-26 21:33:05,144 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-10-26 21:33:05,166 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-10-26 21:33:05,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:33:05,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:33:05,375 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-10-26 21:33:05,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,535 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:05,658 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-10-26 21:33:05,659 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-10-26 21:33:05,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,734 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-10-26 21:33:05,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:05,909 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:05,934 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:05,936 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-10-26 21:33:05,944 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-10-26 21:33:05,945 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:05,983 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,081 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-10-26 21:33:06,081 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:346, output treesize:83 [2018-10-26 21:33:06,344 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-10-26 21:33:06,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 21:33:06,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-10-26 21:33:06,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 21:33:06,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-10-26 21:33:06,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:06,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:06,581 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-10-26 21:33:06,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:06,587 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-10-26 21:33:06,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,610 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-10-26 21:33:06,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,644 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-10-26 21:33:06,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:06,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:06,709 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-10-26 21:33:06,741 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:06,742 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-10-26 21:33:06,743 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:06,923 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-10-26 21:33:06,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:07,029 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-10-26 21:33:07,029 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,059 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:125, output treesize:18 [2018-10-26 21:33:07,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:33:07,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:33:07,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:33:07,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 21:33:07,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:07,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-26 21:33:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 1 times theorem prover too weak. 1 trivial. 2 not checked. [2018-10-26 21:33:07,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:07,643 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 21:33:07,766 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-26 21:33:08,164 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-10-26 21:33:08,169 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-10-26 21:33:08,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:08,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:08,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-10-26 21:33:08,209 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-10-26 21:33:08,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:08,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:08,267 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-10-26 21:33:08,270 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-10-26 21:33:08,271 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:08,285 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 21:33:09,133 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:105, output treesize:161 [2018-10-26 21:33:10,110 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-10-26 21:33:10,468 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-26 21:33:10,978 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-10-26 21:33:11,527 WARN L179 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-26 21:33:11,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:11,946 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:11,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 21:33:12,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:33:12,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:12,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:12,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:33:12,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 21:33:12,153 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-10-26 21:33:12,156 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-10-26 21:33:12,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,167 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-10-26 21:33:12,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,215 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-10-26 21:33:12,231 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-10-26 21:33:12,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,237 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-10-26 21:33:12,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,273 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-10-26 21:33:12,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,314 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-10-26 21:33:12,330 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-10-26 21:33:12,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,340 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-10-26 21:33:12,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,432 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-10-26 21:33:12,437 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-10-26 21:33:12,443 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,446 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-10-26 21:33:12,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,507 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:62 [2018-10-26 21:33:12,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,531 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-10-26 21:33:12,538 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-10-26 21:33:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,619 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-10-26 21:33:12,626 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-10-26 21:33:12,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:64 [2018-10-26 21:33:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:12,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-10-26 21:33:12,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:53 [2018-10-26 21:33:12,871 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-10-26 21:33:12,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 8 treesize of output 7 [2018-10-26 21:33:12,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,927 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-10-26 21:33:12,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:12,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:12,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:85 [2018-10-26 21:33:13,163 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-10-26 21:33:13,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:13,280 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:13,296 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:13,566 INFO L303 Elim1Store]: Index analysis took 395 ms [2018-10-26 21:33:13,567 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-10-26 21:33:13,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:13,590 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-10-26 21:33:13,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:13,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:13,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:13,903 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-10-26 21:33:13,903 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-10-26 21:33:13,929 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-10-26 21:33:13,930 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:33:14,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:33:14,464 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-10-26 21:33:14,648 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:14,780 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-10-26 21:33:14,781 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-10-26 21:33:14,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:14,790 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-10-26 21:33:14,791 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:14,839 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:14,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:14,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:14,857 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-10-26 21:33:14,865 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-10-26 21:33:14,865 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:14,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:14,914 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:14,951 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-10-26 21:33:14,951 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:343, output treesize:72 [2018-10-26 21:33:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-10-26 21:33:15,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:17,661 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-26 21:33:17,923 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 21:33:18,396 WARN L179 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-26 21:33:18,814 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-26 21:33:19,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:33:19,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 31 [2018-10-26 21:33:19,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 21:33:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 21:33:19,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1158, Unknown=4, NotChecked=138, Total=1406 [2018-10-26 21:33:19,120 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 31 states. [2018-10-26 21:33:21,885 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-26 21:33:23,268 WARN L179 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-10-26 21:33:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:25,089 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-10-26 21:33:25,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 21:33:25,093 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-10-26 21:33:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:25,096 INFO L225 Difference]: With dead ends: 101 [2018-10-26 21:33:25,096 INFO L226 Difference]: Without dead ends: 79 [2018-10-26 21:33:25,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=193, Invalid=2160, Unknown=7, NotChecked=190, Total=2550 [2018-10-26 21:33:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-26 21:33:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-26 21:33:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-26 21:33:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-10-26 21:33:25,115 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 49 [2018-10-26 21:33:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:25,117 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-10-26 21:33:25,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 21:33:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-10-26 21:33:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 21:33:25,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:25,118 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-10-26 21:33:25,119 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:25,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1290710851, now seen corresponding path program 1 times [2018-10-26 21:33:25,123 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:25,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:25,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:33:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:25,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:25,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:33:25,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 21:33:25,558 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-10-26 21:33:25,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10-26 21:33:25,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:25,568 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-10-26 21:33:25,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,604 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:25 [2018-10-26 21:33:25,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:25,648 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-10-26 21:33:25,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 21:33:25,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:28 [2018-10-26 21:33:25,796 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:25,797 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:25,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 21:33:25,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:31 [2018-10-26 21:33:25,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:33:25,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:25,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,889 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-10-26 21:33:25,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:25,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:25,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2018-10-26 21:33:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 21:33:26,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:26,992 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-10-26 21:33:27,106 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-26 21:33:27,270 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-26 21:33:27,417 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 21:33:27,503 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:27,516 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-10-26 21:33:27,520 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-10-26 21:33:27,527 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-10-26 21:33:27,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:27,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-26 21:33:27,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 21:33:27,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,618 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:27,621 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-10-26 21:33:27,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 21:33:27,624 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,635 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-10-26 21:33:27,635 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,637 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,653 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-10-26 21:33:27,653 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:89, output treesize:20 [2018-10-26 21:33:27,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:27,698 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:27,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:27,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 21:33:27,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 21:33:27,922 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-10-26 21:33:27,924 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-10-26 21:33:27,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:27,930 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-10-26 21:33:27,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:27,958 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2018-10-26 21:33:28,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:28,027 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-10-26 21:33:28,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 21:33:28,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:39 [2018-10-26 21:33:28,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:28,251 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:28,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:33:28,253 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-10-26 21:33:28,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-10-26 21:33:28,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 21:33:28,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:28,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,402 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-10-26 21:33:28,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 21:33:28,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:28,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:56 [2018-10-26 21:33:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 21:33:28,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:28,989 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-10-26 21:33:29,174 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-26 21:33:29,275 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 21:33:29,349 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:29,360 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-10-26 21:33:29,364 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-10-26 21:33:29,371 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-10-26 21:33:29,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,403 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:29,414 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-10-26 21:33:29,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 21:33:29,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:33:29,474 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-10-26 21:33:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 21:33:29,477 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,486 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-10-26 21:33:29,486 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,488 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:33:29,506 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-10-26 21:33:29,506 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:95, output treesize:20 [2018-10-26 21:33:29,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:33:29,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-10-26 21:33:29,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 21:33:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 21:33:29,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 21:33:29,572 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 28 states. [2018-10-26 21:33:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:31,887 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-10-26 21:33:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 21:33:31,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-10-26 21:33:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:31,889 INFO L225 Difference]: With dead ends: 135 [2018-10-26 21:33:31,890 INFO L226 Difference]: Without dead ends: 78 [2018-10-26 21:33:31,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=194, Invalid=1968, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 21:33:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-26 21:33:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-10-26 21:33:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-26 21:33:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-10-26 21:33:31,902 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 49 [2018-10-26 21:33:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:31,902 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-10-26 21:33:31,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 21:33:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-10-26 21:33:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 21:33:31,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:31,903 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-10-26 21:33:31,905 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:31,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -370667761, now seen corresponding path program 3 times [2018-10-26 21:33:31,906 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:31,906 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:31,932 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 21:33:32,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 21:33:32,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:32,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:33:32,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:33:33,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:33,016 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:33,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:33:45,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 21:33:45,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:45,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:33:45,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:33:46,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 21:33:46,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9, 9] total 20 [2018-10-26 21:33:46,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 21:33:46,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 21:33:46,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:33:46,233 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 20 states. [2018-10-26 21:33:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:47,012 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2018-10-26 21:33:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:33:47,013 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-10-26 21:33:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:47,014 INFO L225 Difference]: With dead ends: 109 [2018-10-26 21:33:47,014 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 21:33:47,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-10-26 21:33:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 21:33:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-26 21:33:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 21:33:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-26 21:33:47,021 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 55 [2018-10-26 21:33:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:47,022 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-26 21:33:47,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 21:33:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-26 21:33:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 21:33:47,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:47,023 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-10-26 21:33:47,023 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:47,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1063022791, now seen corresponding path program 2 times [2018-10-26 21:33:47,026 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:33:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:47,037 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 21:33:47,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:33:47,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:47,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:33:47,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 21:33:47,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:47,444 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/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-10-26 21:33:47,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 21:33:47,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 21:33:47,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:33:47,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 21:33:47,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:33:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 21:33:47,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 21:33:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 9] total 18 [2018-10-26 21:33:47,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 21:33:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 21:33:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:33:47,788 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 18 states. [2018-10-26 21:33:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:47,927 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-10-26 21:33:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:33:47,927 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-10-26 21:33:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:47,927 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:33:47,927 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:33:47,928 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-10-26 21:33:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:33:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:33:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:33:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:33:47,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-10-26 21:33:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:47,929 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:33:47,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 21:33:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:33:47,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:33:47,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:33:48,246 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 21:33:48,559 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-10-26 21:33:48,725 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-10-26 21:33:48,731 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-10-26 21:33:48,732 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 576 589) no Hoare annotation was computed. [2018-10-26 21:33:48,732 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-10-26 21:33:48,733 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-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point L576-4(lines 576 589) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L428 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:33:48,733 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 21:33:48,733 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:33:48,733 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:33:48,734 INFO L421 ceAbstractionStarter]: At program point L609(lines 600 614) the Hoare annotation is: false [2018-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2018-10-26 21:33:48,734 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-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point L603-1(line 603) no Hoare annotation was computed. [2018-10-26 21:33:48,734 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-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2018-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 614) no Hoare annotation was computed. [2018-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 600 614) no Hoare annotation was computed. [2018-10-26 21:33:48,734 INFO L425 ceAbstractionStarter]: For program point L608(lines 608 610) no Hoare annotation was computed. [2018-10-26 21:33:48,735 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-10-26 21:33:48,735 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-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 605 607) no Hoare annotation was computed. [2018-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 612) no Hoare annotation was computed. [2018-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point L594-2(lines 594 596) no Hoare annotation was computed. [2018-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point dll_remove_firstFINAL(lines 592 599) no Hoare annotation was computed. [2018-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point dll_remove_firstEXIT(lines 592 599) no Hoare annotation was computed. [2018-10-26 21:33:48,735 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-10-26 21:33:48,735 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-10-26 21:33:48,755 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,755 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,756 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,756 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,757 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,757 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,757 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,758 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,759 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,767 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,767 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,767 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,780 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,780 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,780 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,780 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,780 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,781 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,782 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,795 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,796 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,796 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,796 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,797 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,797 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,812 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,815 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,834 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,835 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,841 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,842 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,844 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,845 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,846 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,858 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,858 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,858 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,858 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,859 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,859 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,859 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,859 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,860 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,861 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,861 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,861 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,862 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,863 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,877 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,877 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,877 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:33:48 BoogieIcfgContainer [2018-10-26 21:33:48,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:33:48,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:33:48,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:33:48,879 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:33:48,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:32:59" (3/4) ... [2018-10-26 21:33:48,889 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:33:48,894 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-26 21:33:48,894 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:33:48,894 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-10-26 21:33:48,894 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:33:48,894 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2018-10-26 21:33:48,902 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2018-10-26 21:33:48,903 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-10-26 21:33:48,903 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 21:33:48,923 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-10-26 21:33:48,923 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-10-26 21:33:48,938 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_baf5ae18-d811-444a-b2a2-c990751d91b0/bin-2019/utaipan/witness.graphml [2018-10-26 21:33:48,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:33:48,939 INFO L168 Benchmark]: Toolchain (without parser) took 51206.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 939.8 MB in the beginning and 889.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 367.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:48,939 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:33:48,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.72 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 917.0 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:48,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.46 ms. Allocated memory is still 1.0 GB. Free memory was 917.0 MB in the beginning and 911.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:48,940 INFO L168 Benchmark]: Boogie Preprocessor took 101.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 911.6 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:48,940 INFO L168 Benchmark]: RCFGBuilder took 594.82 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-10-26 21:33:48,940 INFO L168 Benchmark]: TraceAbstraction took 49834.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 186.7 MB). Peak memory consumption was 378.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:33:48,941 INFO L168 Benchmark]: Witness Printer took 59.39 ms. Allocated memory is still 1.3 GB. Free memory is still 889.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:33:48,942 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.18 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 562.72 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 917.0 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.46 ms. Allocated memory is still 1.0 GB. Free memory was 917.0 MB in the beginning and 911.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 911.6 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 594.82 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 49834.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 899.9 MB in the end (delta: 186.7 MB). Peak memory consumption was 378.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.39 ms. Allocated memory is still 1.3 GB. Free memory is still 889.7 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-10-26 21:33:48,953 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,953 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,953 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,955 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,956 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,957 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,958 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,961 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,963 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,966 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,967 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_11,QUANTIFIED] [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,968 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,969 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,970 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,971 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,973 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,974 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,975 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-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,976 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,977 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,978 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,979 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,980 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,980 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,981 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,982 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,983 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,986 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,986 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,986 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,986 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,986 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,987 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,987 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,987 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,987 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,987 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,988 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,989 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,989 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,989 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,989 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:33:48,989 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,990 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,991 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:33:48,993 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.6s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 262 SDslu, 1846 SDs, 0 SdLazy, 1679 SolverSat, 114 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 921 SyntacticMatches, 5 SemanticMatches, 168 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 12.3s 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.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 23.3s 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...