./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf658906da38258bbb10e77b5550f740cea929 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:36:21,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:36:21,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:36:21,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:36:21,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:36:21,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:36:21,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:36:21,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:36:21,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:36:21,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:36:21,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:36:21,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:36:21,558 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:36:21,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:36:21,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:36:21,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:36:21,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:36:21,561 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:36:21,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:36:21,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:36:21,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:36:21,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:36:21,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:36:21,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:36:21,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:36:21,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:36:21,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:36:21,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:36:21,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:36:21,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:36:21,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:36:21,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:36:21,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:36:21,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:36:21,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:36:21,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:36:21,568 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 20:36:21,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:36:21,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:36:21,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:36:21,576 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:36:21,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:36:21,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:36:21,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:36:21,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:36:21,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:36:21,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:36:21,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:36:21,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:36:21,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:36:21,579 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_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-02 20:36:21,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:36:21,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:36:21,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:36:21,609 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:36:21,609 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:36:21,610 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 20:36:21,650 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/data/045cfc9c1/2d8bf141ba5f4283a2959917ebf2918a/FLAG42cce3966 [2018-12-02 20:36:22,109 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:36:22,110 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 20:36:22,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/data/045cfc9c1/2d8bf141ba5f4283a2959917ebf2918a/FLAG42cce3966 [2018-12-02 20:36:22,124 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/data/045cfc9c1/2d8bf141ba5f4283a2959917ebf2918a [2018-12-02 20:36:22,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:36:22,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:36:22,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:36:22,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:36:22,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:36:22,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b4d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22, skipping insertion in model container [2018-12-02 20:36:22,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:36:22,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:36:22,303 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:36:22,309 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:36:22,377 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:36:22,398 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:36:22,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22 WrapperNode [2018-12-02 20:36:22,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:36:22,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:36:22,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:36:22,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:36:22,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:36:22,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:36:22,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:36:22,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:36:22,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... [2018-12-02 20:36:22,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:36:22,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:36:22,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:36:22,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:36:22,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:36:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-02 20:36:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-02 20:36:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 20:36:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-02 20:36:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-02 20:36:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:36:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:36:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:36:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 20:36:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 20:36:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:36:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 20:36:22,468 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 20:36:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:36:22,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:36:22,635 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:36:22,635 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 20:36:22,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:36:22 BoogieIcfgContainer [2018-12-02 20:36:22,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:36:22,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:36:22,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:36:22,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:36:22,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:36:22" (1/3) ... [2018-12-02 20:36:22,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:36:22, skipping insertion in model container [2018-12-02 20:36:22,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:36:22" (2/3) ... [2018-12-02 20:36:22,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:36:22, skipping insertion in model container [2018-12-02 20:36:22,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:36:22" (3/3) ... [2018-12-02 20:36:22,640 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 20:36:22,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:36:22,649 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:36:22,658 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:36:22,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:36:22,675 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:36:22,675 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:36:22,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:36:22,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:36:22,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:36:22,676 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:36:22,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:36:22,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:36:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-02 20:36:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 20:36:22,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:22,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:22,691 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:22,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2123187409, now seen corresponding path program 1 times [2018-12-02 20:36:22,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:36:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:36:22,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:36:22,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:36:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:36:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:36:22,822 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-12-02 20:36:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:22,870 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-12-02 20:36:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:36:22,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 20:36:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:22,877 INFO L225 Difference]: With dead ends: 95 [2018-12-02 20:36:22,877 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:36:22,880 INFO L631 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-12-02 20:36:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:36:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-02 20:36:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 20:36:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 20:36:22,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-12-02 20:36:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:22,906 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 20:36:22,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:36:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 20:36:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:36:22,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:22,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:22,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:22,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash -287578872, now seen corresponding path program 1 times [2018-12-02 20:36:22,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:22,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:36:22,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:36:22,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:36:22,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:36:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:36:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:36:22,968 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-12-02 20:36:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:22,983 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-12-02 20:36:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:36:22,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 20:36:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:22,984 INFO L225 Difference]: With dead ends: 73 [2018-12-02 20:36:22,984 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 20:36:22,984 INFO L631 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-12-02 20:36:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 20:36:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-02 20:36:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 20:36:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 20:36:22,988 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-12-02 20:36:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:22,988 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 20:36:22,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:36:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 20:36:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 20:36:22,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:22,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:22,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:22,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1976522614, now seen corresponding path program 1 times [2018-12-02 20:36:22,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:22,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:36:23,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:23,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:23,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:36:23,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 20:36:23,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:36:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:36:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:36:23,110 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2018-12-02 20:36:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:23,139 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-02 20:36:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:36:23,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-02 20:36:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:23,140 INFO L225 Difference]: With dead ends: 73 [2018-12-02 20:36:23,140 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 20:36:23,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:36:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 20:36:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-02 20:36:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 20:36:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 20:36:23,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2018-12-02 20:36:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:23,144 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 20:36:23,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:36:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 20:36:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 20:36:23,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:23,145 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 20:36:23,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:23,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash -602728307, now seen corresponding path program 1 times [2018-12-02 20:36:23,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 20:36:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:36:23,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:36:23,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:36:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:36:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:36:23,194 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-02 20:36:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:23,216 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-02 20:36:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:36:23,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 20:36:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:23,218 INFO L225 Difference]: With dead ends: 67 [2018-12-02 20:36:23,218 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 20:36:23,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:36:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 20:36:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 20:36:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 20:36:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-02 20:36:23,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2018-12-02 20:36:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:23,225 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 20:36:23,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:36:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-02 20:36:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 20:36:23,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:23,226 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:23,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:23,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash -985974537, now seen corresponding path program 1 times [2018-12-02 20:36:23,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 20:36:23,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:23,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:23,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 20:36:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 20:36:23,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:36:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:36:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:36:23,342 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2018-12-02 20:36:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:23,387 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-02 20:36:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:36:23,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-02 20:36:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:23,387 INFO L225 Difference]: With dead ends: 77 [2018-12-02 20:36:23,388 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 20:36:23,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:36:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 20:36:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-12-02 20:36:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 20:36:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-02 20:36:23,394 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2018-12-02 20:36:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:23,394 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-02 20:36:23,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:36:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-02 20:36:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 20:36:23,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:23,396 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:23,396 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:23,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -124170399, now seen corresponding path program 2 times [2018-12-02 20:36:23,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:23,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 20:36:23,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:23,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:23,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:36:23,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:36:23,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:36:23,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 20:36:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:36:23,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-02 20:36:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:36:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:36:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:36:23,532 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-12-02 20:36:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:23,637 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-12-02 20:36:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:36:23,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-12-02 20:36:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:23,639 INFO L225 Difference]: With dead ends: 81 [2018-12-02 20:36:23,639 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 20:36:23,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:36:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 20:36:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-12-02 20:36:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 20:36:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-02 20:36:23,644 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2018-12-02 20:36:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:23,644 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-02 20:36:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:36:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-02 20:36:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 20:36:23,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:23,645 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:23,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:23,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash 850280592, now seen corresponding path program 1 times [2018-12-02 20:36:23,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:23,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:36:23,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:36:24,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:24,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:24,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:24,366 INFO L478 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-12-02 20:36:24,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 20:36:24,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:24,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:24,395 INFO L478 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-12-02 20:36:24,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 20:36:24,401 INFO L478 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 18 treesize of output 15 [2018-12-02 20:36:24,403 INFO L478 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-12-02 20:36:24,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:24,406 INFO L478 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-12-02 20:36:24,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,417 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-02 20:36:24,453 INFO L478 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 45 treesize of output 39 [2018-12-02 20:36:24,458 INFO L478 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 16 treesize of output 15 [2018-12-02 20:36:24,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:24,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-02 20:36:24,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 20:36:24,741 INFO L478 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-12-02 20:36:24,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 20:36:24,782 INFO L478 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 44 treesize of output 38 [2018-12-02 20:36:24,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:24,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:24,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-02 20:36:24,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:24,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:24,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-12-02 20:36:25,291 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2018-12-02 20:36:25,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-02 20:36:25,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:25,300 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 20:36:25,302 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-02 20:36:25,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:25,309 INFO L478 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 7 treesize of output 1 [2018-12-02 20:36:25,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:25,321 INFO L478 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 19 treesize of output 20 [2018-12-02 20:36:25,322 INFO L478 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-12-02 20:36:25,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,331 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2018-12-02 20:36:25,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-02 20:36:25,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 20:36:25,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,555 INFO L478 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-12-02 20:36:25,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:25,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-02 20:36:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 20:36:25,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:25,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2018-12-02 20:36:25,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-02 20:36:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-02 20:36:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2396, Unknown=1, NotChecked=98, Total=2652 [2018-12-02 20:36:25,614 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 52 states. [2018-12-02 20:36:31,940 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-12-02 20:36:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:35,792 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2018-12-02 20:36:35,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-02 20:36:35,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-02 20:36:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:35,794 INFO L225 Difference]: With dead ends: 143 [2018-12-02 20:36:35,794 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 20:36:35,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=668, Invalid=8438, Unknown=18, NotChecked=188, Total=9312 [2018-12-02 20:36:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 20:36:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 86. [2018-12-02 20:36:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 20:36:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-12-02 20:36:35,812 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 52 [2018-12-02 20:36:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:35,813 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-12-02 20:36:35,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-02 20:36:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-12-02 20:36:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 20:36:35,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:35,814 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:35,814 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:35,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:35,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1372027452, now seen corresponding path program 1 times [2018-12-02 20:36:35,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:35,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:35,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:35,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 20:36:35,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:35,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:35,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:35,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 20:36:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 20:36:35,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:36:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:36:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:36:35,921 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 8 states. [2018-12-02 20:36:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:35,969 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2018-12-02 20:36:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:36:35,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-02 20:36:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:35,970 INFO L225 Difference]: With dead ends: 109 [2018-12-02 20:36:35,970 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 20:36:35,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:36:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 20:36:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-12-02 20:36:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 20:36:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-12-02 20:36:35,984 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 53 [2018-12-02 20:36:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:35,984 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-12-02 20:36:35,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:36:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-12-02 20:36:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 20:36:35,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:35,986 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:35,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:35,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash 993490241, now seen corresponding path program 2 times [2018-12-02 20:36:35,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:35,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 20:36:36,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:36,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:36,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:36:36,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:36:36,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:36:36,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 20:36:36,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:36,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 20:36:36,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:36:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:36:36,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:36:36,082 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 8 states. [2018-12-02 20:36:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:36,138 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2018-12-02 20:36:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:36:36,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-02 20:36:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:36,139 INFO L225 Difference]: With dead ends: 131 [2018-12-02 20:36:36,139 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 20:36:36,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:36:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 20:36:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-12-02 20:36:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 20:36:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2018-12-02 20:36:36,151 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 53 [2018-12-02 20:36:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:36,152 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2018-12-02 20:36:36,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:36:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-12-02 20:36:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 20:36:36,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:36,153 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:36,153 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:36,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -726983891, now seen corresponding path program 3 times [2018-12-02 20:36:36,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:36,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:36:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 20:36:36,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:36,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/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-12-02 20:36:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 20:36:36,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 20:36:36,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:36:36,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 20:36:36,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 20:36:36,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:36:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:36:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:36:36,297 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 8 states. [2018-12-02 20:36:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:36,342 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2018-12-02 20:36:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:36:36,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-02 20:36:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:36,343 INFO L225 Difference]: With dead ends: 120 [2018-12-02 20:36:36,343 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 20:36:36,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:36:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 20:36:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-12-02 20:36:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 20:36:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-12-02 20:36:36,350 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 53 [2018-12-02 20:36:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:36,351 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-12-02 20:36:36,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:36:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-12-02 20:36:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 20:36:36,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:36,351 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:36:36,351 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:36,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 949466391, now seen corresponding path program 4 times [2018-12-02 20:36:36,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:36,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:36:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 20:36:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:36,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:36,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 20:36:36,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 20:36:36,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:36:36,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 20:36:36,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:36:36,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-12-02 20:36:36,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:36:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:36:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:36:36,454 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 10 states. [2018-12-02 20:36:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:36,502 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2018-12-02 20:36:36,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:36:36,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-12-02 20:36:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:36,503 INFO L225 Difference]: With dead ends: 116 [2018-12-02 20:36:36,503 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 20:36:36,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:36:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 20:36:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2018-12-02 20:36:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 20:36:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-02 20:36:36,509 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 61 [2018-12-02 20:36:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:36,509 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-02 20:36:36,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:36:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-02 20:36:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 20:36:36,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:36,510 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-12-02 20:36:36,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:36,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash -554830821, now seen corresponding path program 1 times [2018-12-02 20:36:36,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:36,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:36:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 20:36:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:36,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/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-12-02 20:36:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:36,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 20:36:36,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:36:36,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-12-02 20:36:36,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:36:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:36:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:36:36,610 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2018-12-02 20:36:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:36,665 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-02 20:36:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:36:36,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-02 20:36:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:36,666 INFO L225 Difference]: With dead ends: 72 [2018-12-02 20:36:36,666 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 20:36:36,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:36:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 20:36:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-02 20:36:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 20:36:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-12-02 20:36:36,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 62 [2018-12-02 20:36:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:36,673 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-12-02 20:36:36,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:36:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-12-02 20:36:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 20:36:36,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:36,673 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-02 20:36:36,673 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:36,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1980808295, now seen corresponding path program 1 times [2018-12-02 20:36:36,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:36,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 20:36:37,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:37,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:36:37,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:37,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:37,207 INFO L478 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-12-02 20:36:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 20:36:37,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:37,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:37,247 INFO L478 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-12-02 20:36:37,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 20:36:37,270 INFO L478 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 18 treesize of output 15 [2018-12-02 20:36:37,271 INFO L478 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-12-02 20:36:37,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:37,274 INFO L478 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-12-02 20:36:37,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2018-12-02 20:36:37,310 INFO L478 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 45 treesize of output 39 [2018-12-02 20:36:37,312 INFO L478 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 16 treesize of output 15 [2018-12-02 20:36:37,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:37,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-12-02 20:36:37,520 INFO L478 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 15 treesize of output 12 [2018-12-02 20:36:37,521 INFO L478 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 12 treesize of output 1 [2018-12-02 20:36:37,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:37,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:37,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-02 20:36:38,591 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2018-12-02 20:36:38,607 INFO L478 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 50 treesize of output 44 [2018-12-02 20:36:38,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:38,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:38,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:38,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-02 20:36:38,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:38,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-12-02 20:36:38,801 INFO L478 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 29 treesize of output 20 [2018-12-02 20:36:38,802 INFO L478 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 20 treesize of output 19 [2018-12-02 20:36:38,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-02 20:36:38,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-12-02 20:36:38,874 INFO L478 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 36 treesize of output 1 [2018-12-02 20:36:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:38,892 INFO L478 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 101 treesize of output 87 [2018-12-02 20:36:38,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2018-12-02 20:36:38,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 20:36:38,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 20:36:38,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:38,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:104 [2018-12-02 20:36:39,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2018-12-02 20:36:39,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-12-02 20:36:39,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,507 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 100 [2018-12-02 20:36:39,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-02 20:36:39,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-12-02 20:36:39,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2018-12-02 20:36:39,702 INFO L478 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 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-02 20:36:39,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-02 20:36:39,705 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-02 20:36:39,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-02 20:36:39,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:39,771 INFO L478 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 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-02 20:36:39,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-02 20:36:39,773 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-02 20:36:39,794 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-02 20:36:39,814 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,835 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:39,840 INFO L478 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 1 case distinctions, treesize of input 72 treesize of output 74 [2018-12-02 20:36:39,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 20:36:39,842 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-02 20:36:39,869 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 20:36:39,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-02 20:36:39,894 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,915 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:39,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 52 treesize of output 46 [2018-12-02 20:36:39,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 20:36:39,919 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 20:36:39,927 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,932 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:39,937 INFO L478 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 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-02 20:36:39,945 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2018-12-02 20:36:39,947 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:39,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-02 20:36:39,976 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:40,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-02 20:36:40,002 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:40,028 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 20:36:40,032 INFO L478 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 1 case distinctions, treesize of input 48 treesize of output 50 [2018-12-02 20:36:40,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-02 20:36:40,034 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:40,052 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-02 20:36:40,053 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 20:36:40,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-02 20:36:40,070 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 20:36:40,087 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 20:36:40,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-12-02 20:36:40,223 INFO L478 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 16 treesize of output 3 [2018-12-02 20:36:40,223 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,229 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,230 INFO L478 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 34 treesize of output 28 [2018-12-02 20:36:40,232 INFO L478 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 16 treesize of output 3 [2018-12-02 20:36:40,232 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,235 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 20:36:40,238 INFO L478 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-12-02 20:36:40,238 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,241 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,242 INFO L478 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 38 treesize of output 32 [2018-12-02 20:36:40,246 INFO L478 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 16 treesize of output 3 [2018-12-02 20:36:40,246 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,249 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2018-12-02 20:36:40,252 INFO L478 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-12-02 20:36:40,252 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,257 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,264 INFO L478 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 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-02 20:36:40,266 INFO L478 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 56 treesize of output 49 [2018-12-02 20:36:40,267 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,314 INFO L478 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 49 treesize of output 44 [2018-12-02 20:36:40,315 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,337 INFO L478 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 52 treesize of output 40 [2018-12-02 20:36:40,338 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,352 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,356 INFO L478 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 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-02 20:36:40,358 INFO L478 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 32 treesize of output 27 [2018-12-02 20:36:40,358 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,371 INFO L478 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 20 [2018-12-02 20:36:40,372 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,385 INFO L478 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 28 treesize of output 16 [2018-12-02 20:36:40,385 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,392 INFO L267 ElimStorePlain]: Start of recursive call 43: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,398 INFO L478 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 1 case distinctions, treesize of input 54 treesize of output 56 [2018-12-02 20:36:40,401 INFO L478 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 48 treesize of output 36 [2018-12-02 20:36:40,401 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,424 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-02 20:36:40,431 INFO L478 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 44 treesize of output 39 [2018-12-02 20:36:40,432 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,450 INFO L478 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 40 treesize of output 28 [2018-12-02 20:36:40,451 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,467 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 44 [2018-12-02 20:36:40,471 INFO L478 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 16 treesize of output 3 [2018-12-02 20:36:40,471 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,477 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-02 20:36:40,484 INFO L478 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 44 treesize of output 37 [2018-12-02 20:36:40,485 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,503 INFO L478 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 37 treesize of output 32 [2018-12-02 20:36:40,503 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,529 INFO L478 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 40 treesize of output 28 [2018-12-02 20:36:40,529 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,538 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-02 20:36:40,546 INFO L478 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 44 treesize of output 32 [2018-12-02 20:36:40,546 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,566 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-02 20:36:40,574 INFO L478 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 48 treesize of output 41 [2018-12-02 20:36:40,574 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,594 INFO L478 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 41 treesize of output 36 [2018-12-02 20:36:40,594 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,612 INFO L478 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 44 treesize of output 32 [2018-12-02 20:36:40,613 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,623 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 20:36:40,673 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 7 variables, input treesize:99, output treesize:7 [2018-12-02 20:36:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-02 20:36:40,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:40,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 54 [2018-12-02 20:36:40,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-02 20:36:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-02 20:36:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2601, Unknown=1, NotChecked=102, Total=2862 [2018-12-02 20:36:40,732 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 54 states. [2018-12-02 20:36:45,054 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-12-02 20:36:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:46,920 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-12-02 20:36:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-02 20:36:46,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 63 [2018-12-02 20:36:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:46,923 INFO L225 Difference]: With dead ends: 123 [2018-12-02 20:36:46,923 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 20:36:46,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=674, Invalid=8639, Unknown=3, NotChecked=190, Total=9506 [2018-12-02 20:36:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 20:36:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-12-02 20:36:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 20:36:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-02 20:36:46,948 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 63 [2018-12-02 20:36:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:46,949 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-02 20:36:46,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-02 20:36:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-02 20:36:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 20:36:46,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:36:46,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-12-02 20:36:46,950 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:36:46,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:36:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1058530267, now seen corresponding path program 2 times [2018-12-02 20:36:46,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:36:46,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:36:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:36:46,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:36:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:36:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 20:36:47,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:36:47,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/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-12-02 20:36:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:36:47,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:36:47,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:36:47,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:36:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 20:36:47,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:36:47,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 20:36:47,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:36:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:36:47,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:36:47,053 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-12-02 20:36:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:36:47,088 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-02 20:36:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:36:47,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-02 20:36:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:36:47,092 INFO L225 Difference]: With dead ends: 65 [2018-12-02 20:36:47,093 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:36:47,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:36:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:36:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:36:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:36:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:36:47,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-12-02 20:36:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:36:47,093 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:36:47,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:36:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:36:47,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:36:47,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 20:36:47,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:36:47,317 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2018-12-02 20:36:47,491 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-12-02 20:36:47,815 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse2 (<= (+ dll_update_at_~index 1) |dll_update_at_#in~index|)) (.cse4 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse0 (and .cse3 .cse2 .cse4 (<= 2 |dll_update_at_#in~index|))) (.cse1 (+ |dll_update_at_#in~head.offset| 4)) (.cse6 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse7 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (<= |dll_update_at_#in~index| dll_update_at_~index))) (and (or .cse0 (and (<= 1 |dll_update_at_#in~index|) (= dll_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse1)) .cse2 .cse3 .cse4) (and (= |dll_update_at_#in~head.base| dll_update_at_~head.base) (<= dll_update_at_~index |dll_update_at_#in~index|) .cse3 .cse5 .cse4 .cse6 .cse7 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|))) (or .cse0 (and (= (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse1) dll_update_at_~head.offset) .cse6 .cse7) .cse5)))) [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L444 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-02 20:36:47,815 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-02 20:36:47,815 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-02 20:36:47,816 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse3 (= dll_create_~head~0.offset 0)) (.cse0 (= (select |#valid| dll_create_~head~0.base) 1)) (.cse1 (= (select |#valid| dll_create_~new_head~0.base) 1)) (.cse2 (= 0 dll_create_~new_head~0.offset))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ 0 4)) dll_create_~head~0.base)) .cse1 (= 0 dll_create_~head~0.offset) .cse2) (and (= dll_create_~head~0.base 0) (<= |dll_create_#in~len| dll_create_~len) .cse3 (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and .cse3 .cse0 (<= |dll_create_#in~len| (+ dll_create_~len 1)) .cse1 .cse2))) [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 20:36:47,816 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 20:36:47,816 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:36:47,816 INFO L444 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse1 (<= (+ dll_get_data_at_~index 1) |dll_get_data_at_#in~index|))) (or (and (<= |dll_get_data_at_#in~index| dll_get_data_at_~index) (<= dll_get_data_at_~index |dll_get_data_at_#in~index|) (and (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= dll_get_data_at_~head.base |dll_get_data_at_#in~head.base|))) (and (and (or (not (= |dll_get_data_at_#in~head.offset| 0)) (let ((.cse0 (+ (- 0) 4))) (and (= dll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) .cse0)) (= dll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) .cse0))))) (<= 1 |dll_get_data_at_#in~index|)) .cse1) (and (<= 2 |dll_get_data_at_#in~index|) .cse1))) [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse9 (+ 0 4))) (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9))) (let ((.cse1 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)))) (let ((.cse0 (= 0 main_~s~0.offset)) (.cse2 (<= .cse1 (+ main_~len~0 1))) (.cse3 (<= (* 2 main_~len~0) (+ .cse1 1))) (.cse4 (= main_~len~0 2)) (.cse5 (not (= .cse8 main_~s~0.base)))) (or (and .cse0 (<= 1 main_~i~0) (<= (+ main_~i~0 .cse1) (+ main_~expected~0 1)) .cse2 .cse3 .cse4 (<= main_~expected~0 .cse1) .cse5) (and .cse0 .cse2 (let ((.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse6 (+ main_~i~0 .cse7))) (and (<= main_~expected~0 .cse6) (<= .cse7 main_~len~0) (<= .cse6 main_~expected~0) (<= main_~len~0 .cse7) (= main_~i~0 0)))) .cse3 .cse4 .cse5)))))) [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point L624-1(line 624) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2018-12-02 20:36:47,817 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse5 (+ main_~i~0 2))) (let ((.cse1 (= 0 main_~s~0.offset)) (.cse2 (<= main_~new_data~0 .cse5)) (.cse3 (<= .cse5 main_~new_data~0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)))) (or (and (and (let ((.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= (+ main_~i~0 1) .cse0) .cse1 (<= 1 main_~i~0) (<= .cse0 main_~len~0) .cse2 .cse3)) .cse4) (<= main_~len~0 2)) (and .cse1 (and .cse2 .cse3) (= main_~len~0 2) (= main_~i~0 0) .cse4)))) [2018-12-02 20:36:47,818 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-12-02 20:36:47,818 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse7 (+ 0 4))) (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse6 (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)))) (let ((.cse0 (= 0 main_~s~0.offset)) (.cse1 (<= .cse6 (+ main_~len~0 1))) (.cse2 (<= (* 2 main_~len~0) (+ .cse6 1))) (.cse4 (<= 2 main_~len~0)) (.cse3 (not (= .cse5 main_~s~0.base)))) (or (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse0 .cse1 .cse2 (= main_~len~0 2) (= main_~i~0 0) .cse3) (and (<= 2 main_~i~0) (<= main_~len~0 2) .cse4) (and .cse0 (<= 1 main_~i~0) .cse1 .cse2 .cse4 .cse3)))))) [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (<= 2 main_~len~0) [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse7 (+ 0 4))) (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse3 (= main_~len~0 2)) (.cse2 (= 0 main_~s~0.offset)) (.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse4 (not (= .cse6 main_~s~0.base)))) (or (and (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 (<= 1 main_~i~0) (<= main_~i~0 1))) .cse3 .cse4) (and .cse2 .cse3 (= main_~i~0 0) .cse4) (and (let ((.cse5 (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)))) (and .cse2 (and (<= 2 main_~i~0) (<= .cse0 main_~len~0) (<= main_~i~0 .cse0)) (<= (+ main_~i~0 main_~len~0) (+ .cse5 1)) (<= .cse5 (+ main_~len~0 1)) .cse4)) (<= main_~len~0 2)))))) [2018-12-02 20:36:47,818 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-12-02 20:36:47,818 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-02 20:36:47,818 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-12-02 20:36:47,819 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-12-02 20:36:47,819 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-12-02 20:36:47,819 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-02 20:36:47,819 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-12-02 20:36:47,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,831 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,833 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,834 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,839 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,840 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,843 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,843 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,850 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,850 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,853 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,854 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,854 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,861 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,861 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,861 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,861 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,862 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,863 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:36:47 BoogieIcfgContainer [2018-12-02 20:36:47,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:36:47,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:36:47,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:36:47,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:36:47,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:36:22" (3/4) ... [2018-12-02 20:36:47,870 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:36:47,875 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-12-02 20:36:47,878 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-02 20:36:47,878 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 20:36:47,878 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 20:36:47,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\valid[head] == 1 && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[new_head] == 1) && 0 == head) && 0 == new_head) || (((((head == 0 && \old(len) <= len) && head == 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((head == 0 && \valid[head] == 1) && \old(len) <= len + 1) && \valid[new_head] == 1) && 0 == new_head) [2018-12-02 20:36:47,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) [2018-12-02 20:36:47,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(index) <= index && index <= \old(index)) && head == head && head == head) || (((!(head == 0) || (head == #memory_$Pointer$[head][-0 + 4] && head == #memory_$Pointer$[head][-0 + 4])) && 1 <= \old(index)) && index + 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index)) [2018-12-02 20:36:47,905 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_81175edf-5210-400b-a14b-a9d4f3e34f46/bin-2019/uautomizer/witness.graphml [2018-12-02 20:36:47,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:36:47,905 INFO L168 Benchmark]: Toolchain (without parser) took 25779.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 950.6 MB in the beginning and 980.5 MB in the end (delta: -29.9 MB). Peak memory consumption was 202.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: RCFGBuilder took 200.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: TraceAbstraction took 25230.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 980.5 MB in the end (delta: 83.1 MB). Peak memory consumption was 211.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:36:47,906 INFO L168 Benchmark]: Witness Printer took 38.24 ms. Allocated memory is still 1.3 GB. Free memory is still 980.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:36:47,907 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25230.10 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 980.5 MB in the end (delta: 83.1 MB). Peak memory consumption was 211.0 MB. Max. memory is 11.5 GB. * Witness Printer took 38.24 ms. Allocated memory is still 1.3 GB. Free memory is still 980.5 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$.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$.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$.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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - 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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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: 630]: 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: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2018-12-02 20:36:47,910 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,910 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,911 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,912 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,913 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((unknown-#memory_int-unknown[s][s] <= i + 1 && i + 1 <= unknown-#memory_int-unknown[s][s]) && 0 == s) && 1 <= i) && i <= 1) && len == 2) && !(#memory_$Pointer$[s][0 + 4] == s)) || (((0 == s && len == 2) && i == 0) && !(#memory_$Pointer$[s][0 + 4] == s))) || (((((0 == s && (2 <= i && unknown-#memory_int-unknown[s][s] <= len) && i <= unknown-#memory_int-unknown[s][s]) && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && !(#memory_$Pointer$[s][0 + 4] == s)) && len <= 2) - InvariantResult [Line: 607]: Loop Invariant [2018-12-02 20:36:47,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,914 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,915 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) - InvariantResult [Line: 600]: Loop Invariant [2018-12-02 20:36:47,920 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,920 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((\old(index) <= index && index <= \old(index)) && head == head && head == head) || (((!(head == 0) || (head == #memory_$Pointer$[head][-0 + 4] && head == #memory_$Pointer$[head][-0 + 4])) && 1 <= \old(index)) && index + 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2018-12-02 20:36:47,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,923 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\valid[head] == 1 && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[new_head] == 1) && 0 == head) && 0 == new_head) || (((((head == 0 && \old(len) <= len) && head == 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((head == 0 && \valid[head] == 1) && \old(len) <= len + 1) && \valid[new_head] == 1) && 0 == new_head) - InvariantResult [Line: 622]: Loop Invariant [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,925 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,926 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-02 20:36:47,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-02 20:36:47,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((len == unknown-#memory_int-unknown[s][s] && 0 == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && len == 2) && i == 0) && !(#memory_$Pointer$[s][0 + 4] == s)) || ((2 <= i && len <= 2) && 2 <= len)) || (((((0 == s && 1 <= i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && 2 <= len) && !(#memory_$Pointer$[s][0 + 4] == s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 53 locations, 1 error locations. SAFE Result, 25.1s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 609 SDslu, 2831 SDs, 0 SdLazy, 5168 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 545 SyntacticMatches, 7 SemanticMatches, 267 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4444 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 72 PreInvPairs, 102 NumberOfFragments, 869 HoareAnnotationTreeSize, 72 FomulaSimplifications, 9466 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 3131 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1235 ConstructedInterpolants, 42 QuantifiedInterpolants, 358867 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2568 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 375/490 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...