./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d185ad037455b90cde67f589b43e0c5f37430bb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:09:40,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:09:40,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:09:40,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:09:40,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:09:40,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:09:40,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:09:40,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:09:40,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:09:40,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:09:40,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:09:40,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:09:40,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:09:40,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:09:40,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:09:40,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:09:40,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:09:40,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:09:40,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:09:40,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:09:40,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:09:40,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:09:40,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:09:40,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:09:40,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:09:40,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:09:40,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:09:40,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:09:40,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:09:40,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:09:40,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:09:40,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:09:40,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:09:40,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:09:40,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:09:40,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:09:40,829 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:09:40,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:09:40,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:09:40,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:09:40,840 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:09:40,840 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:09:40,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:09:40,841 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:09:40,841 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:09:40,841 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:09:40,841 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:09:40,841 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:09:40,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:09:40,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:09:40,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:09:40,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:09:40,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:09:40,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:09:40,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:09:40,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:09:40,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:09:40,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:09:40,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:09:40,845 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:09:40,845 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d185ad037455b90cde67f589b43e0c5f37430bb [2018-11-10 13:09:40,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:09:40,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:09:40,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:09:40,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:09:40,882 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:09:40,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:09:40,927 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/data/2a0741d00/ea0cce4562234d5ca73b17483a9ae8cf/FLAGb5ac118d2 [2018-11-10 13:09:41,379 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:09:41,380 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:09:41,390 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/data/2a0741d00/ea0cce4562234d5ca73b17483a9ae8cf/FLAGb5ac118d2 [2018-11-10 13:09:41,400 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/data/2a0741d00/ea0cce4562234d5ca73b17483a9ae8cf [2018-11-10 13:09:41,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:09:41,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:09:41,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:09:41,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:09:41,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:09:41,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3d7862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41, skipping insertion in model container [2018-11-10 13:09:41,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:09:41,451 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:09:41,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:09:41,674 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:09:41,709 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:09:41,742 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:09:41,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41 WrapperNode [2018-11-10 13:09:41,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:09:41,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:09:41,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:09:41,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:09:41,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:09:41,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:09:41,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:09:41,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:09:41,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... [2018-11-10 13:09:41,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:09:41,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:09:41,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:09:41,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:09:41,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:09:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-10 13:09:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-10 13:09:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 13:09:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 13:09:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-10 13:09:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:09:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:09:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:09:42,133 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:09:42,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:09:42 BoogieIcfgContainer [2018-11-10 13:09:42,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:09:42,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:09:42,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:09:42,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:09:42,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:09:41" (1/3) ... [2018-11-10 13:09:42,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa1f773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:09:42, skipping insertion in model container [2018-11-10 13:09:42,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:09:41" (2/3) ... [2018-11-10 13:09:42,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa1f773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:09:42, skipping insertion in model container [2018-11-10 13:09:42,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:09:42" (3/3) ... [2018-11-10 13:09:42,139 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:09:42,144 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:09:42,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:09:42,159 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:09:42,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:09:42,179 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:09:42,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:09:42,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:09:42,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:09:42,180 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:09:42,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:09:42,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:09:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-10 13:09:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 13:09:42,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:42,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:42,198 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1923088159, now seen corresponding path program 1 times [2018-11-10 13:09:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:42,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:42,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:09:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:09:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:09:42,298 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:09:42,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:09:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:09:42,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:09:42,312 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-10 13:09:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:42,331 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-10 13:09:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:09:42,332 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-10 13:09:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:42,338 INFO L225 Difference]: With dead ends: 101 [2018-11-10 13:09:42,338 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 13:09:42,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:09:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 13:09:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-10 13:09:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 13:09:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 13:09:42,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 26 [2018-11-10 13:09:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:42,366 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 13:09:42,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:09:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 13:09:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:09:42,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:42,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:42,367 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:42,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1742285523, now seen corresponding path program 1 times [2018-11-10 13:09:42,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,370 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:09:42,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:09:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:09:42,432 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:09:42,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:09:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:09:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:09:42,433 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-11-10 13:09:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:42,478 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-10 13:09:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:09:42,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 13:09:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:42,480 INFO L225 Difference]: With dead ends: 74 [2018-11-10 13:09:42,480 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 13:09:42,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:09:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 13:09:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-11-10 13:09:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 13:09:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 13:09:42,492 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-11-10 13:09:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:42,492 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 13:09:42,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:09:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-10 13:09:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 13:09:42,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:42,493 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:42,494 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:42,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -954388374, now seen corresponding path program 1 times [2018-11-10 13:09:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:42,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:09:42,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:09:42,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:09:42,558 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:09:42,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:09:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:09:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:09:42,559 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-11-10 13:09:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:42,603 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-10 13:09:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:09:42,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 13:09:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:42,607 INFO L225 Difference]: With dead ends: 85 [2018-11-10 13:09:42,607 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 13:09:42,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:09:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 13:09:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-10 13:09:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 13:09:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-10 13:09:42,614 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2018-11-10 13:09:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:42,614 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-10 13:09:42,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:09:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-10 13:09:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 13:09:42,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:42,616 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:42,616 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:42,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1486894025, now seen corresponding path program 1 times [2018-11-10 13:09:42,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:42,617 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:09:42,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:42,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:09:42,706 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-10 13:09:42,707 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-11-10 13:09:42,738 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:09:42,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:09:43,182 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:09:43,183 INFO L272 AbstractInterpreter]: Visited 30 different actions 66 times. Merged at 8 different actions 18 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-10 13:09:43,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:43,198 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:09:43,422 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 76.89% of their original sizes. [2018-11-10 13:09:43,422 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:09:43,807 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-11-10 13:09:43,807 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:09:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:09:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-10 13:09:43,808 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:09:43,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 13:09:43,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 13:09:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:09:43,809 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-11-10 13:09:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:45,387 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-10 13:09:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 13:09:45,388 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-11-10 13:09:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:45,389 INFO L225 Difference]: With dead ends: 88 [2018-11-10 13:09:45,389 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 13:09:45,390 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-11-10 13:09:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 13:09:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-10 13:09:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 13:09:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-10 13:09:45,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 49 [2018-11-10 13:09:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:45,402 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-10 13:09:45,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 13:09:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-10 13:09:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 13:09:45,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:45,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:45,403 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -510098589, now seen corresponding path program 1 times [2018-11-10 13:09:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:45,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:45,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:09:45,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:45,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:09:45,477 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-10 13:09:45,477 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-11-10 13:09:45,478 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:09:45,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:09:45,796 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:09:45,796 INFO L272 AbstractInterpreter]: Visited 42 different actions 173 times. Merged at 21 different actions 69 times. Never widened. Found 13 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-10 13:09:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:45,797 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:09:45,913 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 75.76% of their original sizes. [2018-11-10 13:09:45,913 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:09:46,339 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-10 13:09:46,340 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:09:46,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:09:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-10 13:09:46,340 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:09:46,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:09:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:09:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:09:46,341 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 27 states. [2018-11-10 13:09:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:49,074 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-11-10 13:09:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:09:49,074 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-11-10 13:09:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:49,076 INFO L225 Difference]: With dead ends: 98 [2018-11-10 13:09:49,077 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 13:09:49,078 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 13:09:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 13:09:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2018-11-10 13:09:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 13:09:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-11-10 13:09:49,093 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-11-10 13:09:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:49,093 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-11-10 13:09:49,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:09:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-11-10 13:09:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:09:49,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:49,096 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:09:49,096 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:49,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1402777722, now seen corresponding path program 1 times [2018-11-10 13:09:49,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:49,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:49,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:49,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:49,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:09:49,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:49,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:09:49,175 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-10 13:09:49,175 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [69], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-11-10 13:09:49,179 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:09:49,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:09:49,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:09:49,765 INFO L272 AbstractInterpreter]: Visited 49 different actions 203 times. Merged at 27 different actions 83 times. Never widened. Found 16 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-10 13:09:49,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:49,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:09:49,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:49,771 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:09:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:49,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:09:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:49,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:09:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:09:49,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:09:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:09:50,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:09:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-10 13:09:50,083 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:09:50,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:09:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:09:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:09:50,084 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 6 states. [2018-11-10 13:09:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:09:50,200 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-10 13:09:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:09:50,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-10 13:09:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:09:50,203 INFO L225 Difference]: With dead ends: 136 [2018-11-10 13:09:50,203 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 13:09:50,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:09:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 13:09:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-11-10 13:09:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 13:09:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-11-10 13:09:50,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 63 [2018-11-10 13:09:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:09:50,219 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-11-10 13:09:50,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:09:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-11-10 13:09:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 13:09:50,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:09:50,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-11-10 13:09:50,221 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:09:50,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:09:50,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1136256485, now seen corresponding path program 2 times [2018-11-10 13:09:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:09:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:50,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:09:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:09:50,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:09:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:09:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:09:50,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:50,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:09:50,971 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:09:50,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:09:50,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:09:50,971 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:09:50,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:09:50,979 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:09:51,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 13:09:51,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:09:51,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:09:51,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 13:09:51,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 13:09:51,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:09:51,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:09:51,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 13:09:51,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-10 13:09:51,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:09:51,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:09:51,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:09:51,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:09:51,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:51,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-11-10 13:09:53,329 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-11-10 13:09:55,364 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 13:09:57,403 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 13:09:57,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-10 13:09:57,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-10 13:09:57,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:57,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:57,415 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-11-10 13:09:57,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-11-10 13:09:59,451 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 13:09:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-10 13:09:59,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-10 13:09:59,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:09:59,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:09:59,503 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-11-10 13:09:59,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-11-10 13:10:05,539 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 13:10:09,574 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 13:10:09,578 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((|sll_update_at_write~int_#ptr.offset| Int) (|sll_update_at_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) |sll_update_at_write~int_#ptr.offset| |sll_update_at_write~int_#value|)) |c_#memory_int|))) is different from true [2018-11-10 13:10:09,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:10:09,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-11-10 13:10:09,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:10:09,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:09,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:09,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:09,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:50 [2018-11-10 13:10:09,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 64 [2018-11-10 13:10:09,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:10:09,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-11-10 13:10:09,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:09,983 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:10:09,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-11-10 13:10:09,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:09,999 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:10:09,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-11-10 13:10:10,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 13:10:10,030 INFO L477 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 46 treesize of output 40 [2018-11-10 13:10:10,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:10:10,033 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 13:10:10,047 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,052 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-11-10 13:10:10,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-10 13:10:10,059 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-10 13:10:10,072 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-10 13:10:10,084 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:10:10,095 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 13:10:10,117 INFO L477 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 34 treesize of output 28 [2018-11-10 13:10:10,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-10 13:10:10,123 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,128 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-10 13:10:10,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-10 13:10:10,135 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-10 13:10:10,149 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-10 13:10:10,162 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,169 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,171 INFO L477 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 23 treesize of output 19 [2018-11-10 13:10:10,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:10:10,172 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,176 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:10,189 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:69, output treesize:7 [2018-11-10 13:10:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-11-10 13:10:10,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:10:10,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:12,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:12,490 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:15,156 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-10 13:10:15,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:15,168 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:15,178 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:10:19,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 53 [2018-11-10 13:10:19,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 13:10:19,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-11-10 13:10:19,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-10 13:10:19,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-10 13:10:19,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-10 13:10:19,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,916 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:10:19,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 53 [2018-11-10 13:10:19,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 13:10:19,962 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-11-10 13:10:19,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-10 13:10:19,976 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,978 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-10 13:10:19,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-10 13:10:19,981 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,986 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:10:19,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:10:20,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 13:10:20,019 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:167, output treesize:59 [2018-11-10 13:10:20,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-11-10 13:10:20,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 13:10:20,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 13:10:20,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 13:10:20,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:10:20,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 13:10:20,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 13:10:20,244 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:10:20,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:10:20,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-11-10 13:10:20,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 13:10:20,302 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 13:10:20,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 13:10:20,317 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 13:10:20,326 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 13:10:20,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 13:10:20,337 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 13:10:20,342 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:10:20,349 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:10:20,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 13:10:20,386 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:143, output treesize:195 [2018-11-10 13:10:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:21,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:10:21,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 28] total 74 [2018-11-10 13:10:21,479 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:10:21,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-10 13:10:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-10 13:10:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4883, Unknown=7, NotChecked=282, Total=5402 [2018-11-10 13:10:21,481 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 49 states. [2018-11-10 13:11:00,000 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 13:11:06,058 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-10 13:11:14,276 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-11-10 13:11:18,349 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-10 13:11:20,475 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:11:36,870 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-11-10 13:12:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:44,607 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2018-11-10 13:12:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 13:12:44,608 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 73 [2018-11-10 13:12:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:44,609 INFO L225 Difference]: With dead ends: 186 [2018-11-10 13:12:44,610 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 13:12:44,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2109 ImplicationChecksByTransitivity, 87.0s TimeCoverageRelationStatistics Valid=622, Invalid=10072, Unknown=26, NotChecked=410, Total=11130 [2018-11-10 13:12:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 13:12:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2018-11-10 13:12:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 13:12:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-11-10 13:12:44,637 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 73 [2018-11-10 13:12:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:44,638 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-11-10 13:12:44,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-10 13:12:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-11-10 13:12:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 13:12:44,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:12:44,639 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-10 13:12:44,639 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:12:44,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1856537867, now seen corresponding path program 3 times [2018-11-10 13:12:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:12:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:44,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:12:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:44,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:12:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:12:44,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:44,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:12:44,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:12:44,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:12:44,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:44,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:12:44,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:12:44,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:12:44,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:12:44,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:12:44,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:12:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:12:44,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:12:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:12:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:12:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2018-11-10 13:12:44,878 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:12:44,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:12:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:12:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:12:44,878 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 7 states. [2018-11-10 13:12:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:44,915 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2018-11-10 13:12:44,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:12:44,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-10 13:12:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:44,916 INFO L225 Difference]: With dead ends: 154 [2018-11-10 13:12:44,917 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 13:12:44,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:12:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 13:12:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-10 13:12:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-10 13:12:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-11-10 13:12:44,936 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 75 [2018-11-10 13:12:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:44,936 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-11-10 13:12:44,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:12:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-11-10 13:12:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 13:12:44,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:12:44,938 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1] [2018-11-10 13:12:44,938 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:12:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1779274111, now seen corresponding path program 4 times [2018-11-10 13:12:44,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:12:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:44,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:12:44,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:44,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:12:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:12:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:44,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:12:44,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:12:44,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:12:44,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:44,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/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-11-10 13:12:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:12:45,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:12:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:45,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:12:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:12:45,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:12:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:12:45,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:12:45,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-10 13:12:45,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:12:45,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:12:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:12:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:12:45,133 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 7 states. [2018-11-10 13:12:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:45,185 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2018-11-10 13:12:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:12:45,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-10 13:12:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:45,186 INFO L225 Difference]: With dead ends: 178 [2018-11-10 13:12:45,186 INFO L226 Difference]: Without dead ends: 118 [2018-11-10 13:12:45,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:12:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-10 13:12:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-11-10 13:12:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 13:12:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-11-10 13:12:45,203 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 75 [2018-11-10 13:12:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:45,203 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-11-10 13:12:45,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:12:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-11-10 13:12:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 13:12:45,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:12:45,204 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1] [2018-11-10 13:12:45,205 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:12:45,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash 53331007, now seen corresponding path program 5 times [2018-11-10 13:12:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:12:45,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:45,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:12:45,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:45,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:12:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:12:45,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:45,267 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:12:45,267 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:12:45,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:12:45,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:45,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:12:45,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:12:45,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:12:45,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 13:12:45,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:12:45,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:12:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:12:45,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:12:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:12:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:12:45,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-10 13:12:45,461 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:12:45,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:12:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:12:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:12:45,461 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 7 states. [2018-11-10 13:12:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:45,506 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-11-10 13:12:45,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:12:45,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-10 13:12:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:45,507 INFO L225 Difference]: With dead ends: 129 [2018-11-10 13:12:45,507 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 13:12:45,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:12:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 13:12:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-10 13:12:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 13:12:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-10 13:12:45,516 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 75 [2018-11-10 13:12:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:45,516 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-10 13:12:45,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:12:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-10 13:12:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 13:12:45,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:12:45,517 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-10 13:12:45,517 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:12:45,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 500744283, now seen corresponding path program 1 times [2018-11-10 13:12:45,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:12:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:45,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:12:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:45,518 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:12:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 13:12:45,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:45,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:12:45,721 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-10 13:12:45,721 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [69], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [109], [111], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-11-10 13:12:45,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:12:45,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:12:46,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:12:46,418 INFO L272 AbstractInterpreter]: Visited 51 different actions 293 times. Merged at 32 different actions 142 times. Widened at 2 different actions 2 times. Found 29 fixpoints after 8 different actions. Largest state had 42 variables. [2018-11-10 13:12:46,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:46,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:12:46,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:46,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:12:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:12:46,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:12:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:46,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:12:46,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:12:46,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:12:46,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-11-10 13:12:46,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-11-10 13:12:46,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-10 13:12:46,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-10 13:12:46,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:12:46,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-10 13:12:46,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:46,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:12:46,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:60, output treesize:27 [2018-11-10 13:12:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:12:46,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:12:47,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 13:12:47,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 13:12:47,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 13:12:47,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 13:12:47,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-10 13:12:47,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-10 13:12:47,254 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 13:12:47,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 13:12:47,302 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-10 13:12:47,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 13:12:47,309 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:12:47,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 13:12:47,344 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:121 [2018-11-10 13:12:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:12:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:12:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 36 [2018-11-10 13:12:47,577 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:12:47,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:12:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:12:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 13:12:47,578 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 27 states. [2018-11-10 13:12:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:48,220 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-10 13:12:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 13:12:48,220 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-10 13:12:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:48,221 INFO L225 Difference]: With dead ends: 100 [2018-11-10 13:12:48,221 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 13:12:48,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 13:12:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 13:12:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-11-10 13:12:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 13:12:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-11-10 13:12:48,233 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 85 [2018-11-10 13:12:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:48,233 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-11-10 13:12:48,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:12:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-11-10 13:12:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 13:12:48,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:12:48,234 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:12:48,234 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:12:48,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:12:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1014667777, now seen corresponding path program 2 times [2018-11-10 13:12:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:12:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:48,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:12:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:12:48,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:12:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:12:48,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:48,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:12:48,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:12:48,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:12:48,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:12:48,286 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:12:48,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:12:48,292 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:12:48,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:12:48,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:12:48,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:12:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:12:48,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:12:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:12:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:12:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-10 13:12:48,383 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:12:48,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:12:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:12:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:12:48,384 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 7 states. [2018-11-10 13:12:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:12:48,425 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-10 13:12:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:12:48,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-10 13:12:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:12:48,426 INFO L225 Difference]: With dead ends: 106 [2018-11-10 13:12:48,426 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:12:48,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:12:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:12:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:12:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:12:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:12:48,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-10 13:12:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:12:48,427 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:12:48,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:12:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:12:48,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:12:48,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:12:49,049 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2018-11-10 13:12:56,582 WARN L179 SmtUtils]: Spent 7.51 s on a formula simplification. DAG size of input: 232 DAG size of output: 110 [2018-11-10 13:12:56,725 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2018-11-10 13:12:56,921 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2018-11-10 13:12:57,082 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2018-11-10 13:12:57,218 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2018-11-10 13:12:57,328 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 45 [2018-11-10 13:13:00,443 WARN L179 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 143 DAG size of output: 63 [2018-11-10 13:13:00,663 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2018-11-10 13:13:00,665 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-10 13:13:00,665 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:13:00,665 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-10 13:13:00,665 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:13:00,665 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:13:00,665 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-10 13:13:00,666 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:13:00,666 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse6 (+ sll_update_at_~index sll_update_at_~head.offset))) (let ((.cse8 (<= .cse6 1)) (.cse3 (+ sll_update_at_~index 1)) (.cse11 (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~index|))) (let ((.cse0 (= |sll_update_at_#in~head.base| 0)) (.cse9 (< 1 .cse11)) (.cse1 (let ((.cse14 (<= (* 2 sll_update_at_~data) 6))) (or (and (not (= sll_update_at_~head.base 0)) (<= sll_update_at_~index (+ sll_update_at_~head.offset 1)) .cse8 .cse14 (<= sll_update_at_~head.offset sll_update_at_~index) (<= 0 .cse6) (<= 1 (+ sll_update_at_~head.offset sll_update_at_~data))) (let ((.cse15 (* 2 sll_update_at_~index))) (and (<= 0 .cse15) .cse14 (<= .cse3 sll_update_at_~data) (<= .cse15 0)))))) (.cse7 (= |sll_update_at_#in~head.base| sll_update_at_~head.base)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2)) .cse0 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 4) (let ((.cse2 (+ |sll_update_at_#in~head.offset| 4))) (and .cse1 (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse2) sll_update_at_~head.base) (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse2)) (<= .cse3 |sll_update_at_#in~index|) .cse4 .cse5)) (and (<= |sll_update_at_#in~data| sll_update_at_~data) (<= 1 .cse6) .cse7 (= sll_update_at_~index 1) .cse4 .cse8 (<= (+ sll_update_at_~index sll_update_at_~data) 4)) (< (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) .cse9) (or (and (and .cse1 .cse4) (<= 1 |sll_update_at_#in~index|)) (let ((.cse10 (* 2 |sll_update_at_#in~head.offset|)) (.cse13 (* 2 |sll_update_at_#in~data|))) (or (< 0 .cse10) (< .cse11 0) .cse0 (< .cse10 0) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse12 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse12 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| (select .cse12 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) (< 6 .cse13) .cse9 (< .cse13 2))) (and (<= sll_update_at_~index 0) .cse1 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse7 .cse4 .cse5)))))) [2018-11-10 13:13:00,666 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L421 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (let ((.cse1 (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~index|))) (let ((.cse2 (= |sll_update_at_#in~head.base| 0)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse5 (< 1 .cse1))) (and (or (let ((.cse0 (* 2 |sll_update_at_#in~head.offset|)) (.cse4 (* 2 |sll_update_at_#in~data|))) (or (< 0 .cse0) (< .cse1 0) .cse2 (< .cse0 0) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse3 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| (select .cse3 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) (< 6 .cse4) .cse5 (< .cse4 2))) .cse6) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2)) .cse2 .cse6 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 4) (< (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) .cse5)))) [2018-11-10 13:13:00,667 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse1 (* 2 |sll_create_#in~len|)) (.cse2 (+ |sll_create_#in~data| |sll_create_#in~len|))) (let ((.cse0 (and (<= .cse1 4) (<= 3 .cse2) (and (<= sll_create_~data (+ sll_create_~head~0.offset 1)) (<= 1 (+ sll_create_~head~0.offset sll_create_~data)) (<= (* 2 sll_create_~head~0.offset) 0) (<= (* 2 sll_create_~len) 4) (<= 2 (+ sll_create_~data sll_create_~len))) (= |sll_create_#in~data| 1)))) (or (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) .cse0) (< 4 .cse1) (< 2 (* 2 |sll_create_#in~data|)) (< .cse2 3) (and (= (select |#valid| sll_create_~head~0.base) 1) .cse0)))) [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (let ((.cse7 (+ sll_create_~head~0.offset sll_create_~data))) (let ((.cse6 (+ sll_create_~head~0.offset 1)) (.cse5 (<= 1 .cse7)) (.cse4 (<= (* 2 sll_create_~head~0.offset) 0))) (let ((.cse0 (and (<= sll_create_~data .cse6) .cse5 .cse4 (<= (* 2 sll_create_~len) 4) (<= 2 (+ sll_create_~data sll_create_~len))))) (let ((.cse1 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse2 (not (= sll_create_~head~0.base 0))) (.cse3 (or .cse0 (and (<= 0 (+ sll_create_~head~0.offset sll_create_~len)) .cse5 (<= sll_create_~len .cse6) (<= .cse7 1))))) (or (< 4 (* 2 |sll_create_#in~len|)) (< 2 (* 2 |sll_create_#in~data|)) (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) .cse0) (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (+ 0 4)) sll_create_~head~0.base)) .cse1 .cse2 .cse3 (= 0 sll_create_~head~0.offset)) (< (+ |sll_create_#in~data| |sll_create_#in~len|) 3) (and (<= |sll_create_#in~len| (+ sll_create_~len 1)) .cse1 .cse2 .cse3 .cse4)))))) [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |sll_create_#in~data| 1)) (< 3 (+ |sll_create_#in~data| |sll_create_#in~len|)) (< (* 2 |sll_create_#in~len|) 4)) [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:13:00,667 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:13:00,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:13:00,667 INFO L428 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L589-1(lines 589 592) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L421 ceAbstractionStarter]: At program point L589-3(lines 589 592) the Hoare annotation is: (let ((.cse3 (forall ((v_main_~s~0.offset_BEFORE_CALL_7 Int) (v_main_~s~0.base_BEFORE_CALL_7 Int) (v_main_~len~0_BEFORE_CALL_21 Int)) (let ((.cse6 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7))) (or (< 2 v_main_~len~0_BEFORE_CALL_21) (< (* 2 v_main_~len~0_BEFORE_CALL_21) (+ .cse6 2)) (< .cse6 v_main_~len~0_BEFORE_CALL_21))))) (.cse0 (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) (and (or (and (<= (+ sll_get_data_at_~head.offset 1) sll_get_data_at_~index) .cse0) (< (* 2 |sll_get_data_at_#in~head.offset|) 0) (let ((.cse1 (+ |sll_get_data_at_#in~head.offset| 4))) (and (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse1)) (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse1)))) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse2 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse2 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |#memory_int| (select .cse2 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) .cse3 (= |sll_get_data_at_#in~head.base| 0) (not (= |sll_get_data_at_#in~index| 1)) (< 1 (+ |sll_get_data_at_#in~index| |sll_get_data_at_#in~head.offset|))) (let ((.cse4 (<= sll_get_data_at_~index 0)) (.cse5 (<= 1 |sll_get_data_at_#in~index|))) (or (<= 2 |sll_get_data_at_#in~index|) (and .cse4 .cse5) .cse3 (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) .cse0 (< sll_get_data_at_~index 2) (or .cse4 .cse5)))))) [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L589-4(lines 589 592) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L421 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse0 (not (= main_~s~0.base 0))) (.cse4 (not (= main_~s~0.base (select .cse2 (+ 0 4))))) (.cse5 (<= (+ main_~len~0 main_~data~0) 3)) (.cse6 (<= main_~len~0 (+ main_~data~0 1))) (.cse7 (<= 2 (+ main_~s~0.offset main_~len~0)))) (or (let ((.cse1 (* 2 main_~len~0))) (and .cse0 (= .cse1 (+ (let ((.cse3 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse2 .cse3)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse3))) 1)) .cse4 (<= (+ main_~new_data~0 2) (+ main_~i~0 .cse1)) (<= main_~len~0 main_~new_data~0) .cse5 .cse6 (<= (* 2 main_~s~0.offset) 0) (<= main_~i~0 0) .cse7)) (and .cse0 .cse4 .cse5 (<= (+ main_~len~0 1) main_~new_data~0) .cse6 (= main_~i~0 1) (<= (+ main_~s~0.offset main_~new_data~0) 3) .cse7 (<= 3 (+ main_~i~0 main_~len~0)))))) [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L611-3(lines 611 616) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L421 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (let ((.cse3 (+ main_~new_data~0 2)) (.cse6 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse10 (not (= main_~s~0.base 0))) (.cse0 (<= main_~len~0 main_~new_data~0)) (.cse11 (<= (* 2 main_~s~0.offset) 0)) (.cse2 (<= main_~len~0 .cse5)) (.cse12 (= main_~data~0 1)) (.cse13 (+ main_~i~0 main_~len~0)) (.cse9 (<= .cse3 .cse6))) (or (and (let ((.cse1 (and .cse10 .cse11 .cse12 (<= 1 .cse13) (<= 2 (+ main_~s~0.offset main_~len~0))))) (or (let ((.cse4 (+ main_~i~0 .cse6))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) (<= (+ .cse5 2) .cse4))) (and .cse0 .cse1 (exists ((main_~len~0 Int)) (let ((.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse8 (* 2 main_~len~0))) (and (<= main_~len~0 main_~expected~0) (<= main_~len~0 .cse7) (<= (+ .cse7 2) .cse8) (<= main_~len~0 2) (<= (+ main_~expected~0 2) .cse8)))) .cse9))) (<= main_~len~0 2) (<= main_~i~0 0)) (let ((.cse14 (select |#memory_$Pointer$.base| main_~s~0.base))) (and .cse10 (= .cse6 (+ (let ((.cse15 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse14 .cse15)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse15))) 1)) .cse0 (not (= main_~s~0.base (select .cse14 (+ 0 4)))) .cse11 .cse2 .cse12 (<= (+ main_~i~0 1) main_~len~0) (<= main_~len~0 (+ main_~s~0.offset 2)) (<= (+ .cse5 1) .cse13) .cse9))))) [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:13:00,668 INFO L428 ceAbstractionStarter]: At program point L611-5(lines 611 616) the Hoare annotation is: true [2018-11-10 13:13:00,668 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (let ((.cse0 (+ main_~data~0 1))) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= .cse0 main_~len~0) (<= main_~len~0 .cse0) (= main_~len~0 2))) [2018-11-10 13:13:00,668 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L421 ceAbstractionStarter]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse3 (* 2 main_~len~0)) (.cse10 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse1 (= .cse3 (+ (let ((.cse11 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse10 .cse11)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse11))) 1))) (.cse0 (not (= main_~s~0.base 0))) (.cse4 (not (= main_~s~0.base (select .cse10 (+ 0 4))))) (.cse5 (<= (* 2 main_~s~0.offset) 0)) (.cse6 (= main_~data~0 1)) (.cse8 (<= (+ main_~i~0 1) main_~len~0)) (.cse9 (<= main_~len~0 (+ main_~s~0.offset 2))) (.cse7 (+ main_~i~0 main_~len~0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 main_~new_data~0) (<= (+ .cse2 2) .cse3) .cse4 .cse5 (<= main_~len~0 .cse2) .cse6 (<= 1 .cse7) .cse8 .cse9 (<= (+ main_~new_data~0 2) .cse3))) (and .cse0 .cse1 .cse4 (= (+ main_~new_data~0 1) .cse3) (<= (+ main_~len~0 main_~data~0) 3) (<= main_~len~0 (+ main_~data~0 1)) (<= (+ main_~s~0.offset main_~new_data~0) 3) (<= main_~i~0 0) (<= main_~len~0 (+ main_~i~0 2)) (<= 4 .cse3) (<= 2 (+ main_~s~0.offset main_~len~0))) (and .cse0 .cse4 .cse5 .cse6 .cse8 .cse9 (<= 3 .cse7))))) [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L421 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-11-10 13:13:00,669 INFO L421 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse0 (not (= main_~s~0.base 0))) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (* 2 main_~s~0.offset) 0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse7 (<= 2 (+ main_~s~0.offset main_~len~0))) (.cse8 (+ main_~new_data~0 2)) (.cse5 (* 2 main_~len~0))) (or (and .cse0 (exists ((main_~len~0 Int)) (let ((.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse2 (* 2 main_~len~0))) (and (<= main_~len~0 main_~expected~0) (<= main_~len~0 .cse1) (<= (+ .cse1 2) .cse2) (<= main_~len~0 2) (<= (+ main_~expected~0 2) .cse2)))) .cse3 .cse4 (= main_~data~0 1) (<= main_~i~0 0) (<= .cse5 (+ .cse6 2)) .cse7 (<= .cse8 (+ main_~i~0 .cse5))) (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (and .cse0 (not (= main_~s~0.base (select .cse9 (+ 0 4)))) (<= main_~len~0 .cse6) (= 3 (let ((.cse10 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse9 .cse10)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse10)))) .cse3 (<= (+ main_~len~0 main_~data~0) 3) (<= main_~len~0 (+ main_~data~0 1)) .cse4 (<= (+ main_~i~0 main_~expected~0) 4) (<= (+ .cse6 1) (+ main_~i~0 main_~len~0)) .cse7 (<= (+ main_~i~0 2) main_~expected~0) (<= .cse8 .cse5))))) [2018-11-10 13:13:00,669 INFO L425 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point L613-2(lines 613 615) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 616) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |node_create_#in~data| 1))) [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:13:00,670 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:13:00,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,678 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,683 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,683 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,683 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,684 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,684 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,684 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,686 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,689 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,689 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,689 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,689 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,690 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,690 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,690 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,690 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,690 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,696 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,697 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,697 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,697 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,698 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,699 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,701 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,702 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,703 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,704 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,704 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,704 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,705 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,705 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,706 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,706 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,709 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,710 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,711 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,711 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,712 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,718 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,719 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,719 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,720 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,720 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,720 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,721 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,721 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,722 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,722 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,723 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,723 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,723 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,723 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,724 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,724 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,724 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,727 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,728 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,728 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,728 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,728 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,729 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,729 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,730 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,730 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,730 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,730 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,731 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,732 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,732 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:13:00 BoogieIcfgContainer [2018-11-10 13:13:00,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:13:00,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:13:00,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:13:00,734 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:13:00,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:09:42" (3/4) ... [2018-11-10 13:13:00,739 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:13:00,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 13:13:00,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:13:00,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-10 13:13:00,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-11-10 13:13:00,745 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-10 13:13:00,746 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-11-10 13:13:00,746 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:13:00,746 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 13:13:00,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2018-11-10 13:13:00,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-10 13:13:00,751 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 13:13:00,772 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4 < 2 * \old(len) || 2 < 2 * \old(data)) || (((\valid == \old(\valid) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && (((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len)) || ((((!(#memory_$Pointer$[head][0 + 4] == head) && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 0 == head)) || \old(data) + \old(len) < 3) || ((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 2 * head <= 0) [2018-11-10 13:13:00,773 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && len <= unknown-#memory_int-unknown[s][s]) && new_data + 2 <= i + 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= i + 2 * len) || (((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && (\exists main_~len~0 : int :: (((main_~len~0 <= expected && main_~len~0 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * main_~len~0) && main_~len~0 <= 2) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len)) && len <= 2) && i <= 0) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && i + 1 <= len) && len <= s + 2) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && new_data + 2 <= 2 * len) [2018-11-10 13:13:00,773 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0 + 4] == v_main_~s~0.base_BEFORE_CALL_2) || head == 0) || head + 1 < \old(index)) || \old(index) + \old(data) < 4) || ((((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && #memory_$Pointer$[head][head + 4] == head) && head == #memory_$Pointer$[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((((((\old(data) <= data && 1 <= index + head) && head == head) && index == 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + head <= 1) && index + data <= 4)) || \old(index) + 2 < \old(data)) || 1 < head + \old(index)) && (((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((0 < 2 * head || head + \old(index) < 0) || head == 0) || 2 * head < 0) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || 6 < 2 * \old(data)) || 1 < head + \old(index)) || 2 * \old(data) < 2) || (((((index <= 0 && (((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0))) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) [2018-11-10 13:13:00,773 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((head + 1 <= index && head == head) || 2 * head < 0) || (head == #memory_$Pointer$[head][head + 4] && head == #memory_$Pointer$[head][head + 4])) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || head == 0) || !(\old(index) == 1)) || 1 < \old(index) + head) && (((2 <= \old(index) || (index <= 0 && 1 <= \old(index))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) [2018-11-10 13:13:00,789 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f24d2557-c253-42e1-834b-e5ae86588ecd/bin-2019/utaipan/witness.graphml [2018-11-10 13:13:00,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:13:00,790 INFO L168 Benchmark]: Toolchain (without parser) took 199386.78 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 563.6 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -298.0 MB). Peak memory consumption was 265.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,790 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:13:00,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.17 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,791 INFO L168 Benchmark]: Boogie Preprocessor took 24.26 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-11-10 13:13:00,791 INFO L168 Benchmark]: RCFGBuilder took 289.27 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,791 INFO L168 Benchmark]: TraceAbstraction took 198599.92 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 453.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.6 MB). Peak memory consumption was 743.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,792 INFO L168 Benchmark]: Witness Printer took 55.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:13:00,793 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.17 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.26 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 289.27 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198599.92 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 453.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.6 MB). Peak memory consumption was 743.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.17 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_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_$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_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$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: 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: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant [2018-11-10 13:13:00,798 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,798 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,799 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,802 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,802 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:13:00,802 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,802 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,802 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,803 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,804 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && len <= unknown-#memory_int-unknown[s][s]) && new_data + 2 <= i + 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= i + 2 * len) || (((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && (\exists main_~len~0 : int :: (((main_~len~0 <= expected && main_~len~0 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * main_~len~0) && main_~len~0 <= 2) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len)) && len <= 2) && i <= 0) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && i + 1 <= len) && len <= s + 2) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && new_data + 2 <= 2 * len) - InvariantResult [Line: 589]: Loop Invariant [2018-11-10 13:13:00,804 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,805 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,809 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,812 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:13:00,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:13:00,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,814 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((head + 1 <= index && head == head) || 2 * head < 0) || (head == #memory_$Pointer$[head][head + 4] && head == #memory_$Pointer$[head][head + 4])) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || head == 0) || !(\old(index) == 1)) || 1 < \old(index) + head) && (((2 <= \old(index) || (index <= 0 && 1 <= \old(index))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) - InvariantResult [Line: 596]: Loop Invariant [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,819 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,819 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,819 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,820 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,821 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,821 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,821 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,821 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,822 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0 + 4] == v_main_~s~0.base_BEFORE_CALL_2) || head == 0) || head + 1 < \old(index)) || \old(index) + \old(data) < 4) || ((((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && #memory_$Pointer$[head][head + 4] == head) && head == #memory_$Pointer$[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((((((\old(data) <= data && 1 <= index + head) && head == head) && index == 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + head <= 1) && index + data <= 4)) || \old(index) + 2 < \old(data)) || 1 < head + \old(index)) && (((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((0 < 2 * head || head + \old(index) < 0) || head == 0) || 2 * head < 0) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || 6 < 2 * \old(data)) || 1 < head + \old(index)) || 2 * \old(data) < 2) || (((((index <= 0 && (((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0))) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) - InvariantResult [Line: 574]: Loop Invariant [2018-11-10 13:13:00,824 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,825 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((4 < 2 * \old(len) || 2 < 2 * \old(data)) || (((\valid == \old(\valid) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && (((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len)) || ((((!(#memory_$Pointer$[head][0 + 4] == head) && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 0 == head)) || \old(data) + \old(len) < 3) || ((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 2 * head <= 0) - InvariantResult [Line: 607]: Loop Invariant [2018-11-10 13:13:00,826 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,826 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,828 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,829 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,830 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:13:00,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:13:00,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && 1 <= i + len) && i + 1 <= len) && len <= s + 2) && new_data + 2 <= 2 * len) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && !(s == #memory_$Pointer$[s][0 + 4])) && new_data + 1 == 2 * len) && len + data <= 3) && len <= data + 1) && s + new_data <= 3) && i <= 0) && len <= i + 2) && 4 <= 2 * len) && 2 <= s + len)) || ((((((!(s == 0) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && data == 1) && i + 1 <= len) && len <= s + 2) && 3 <= i + len) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 63 locations, 1 error locations. SAFE Result, 198.4s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 148.5s AutomataDifference, 0.0s DeadEndRemovalTime, 12.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 610 SDslu, 3476 SDs, 0 SdLazy, 3018 SolverSat, 313 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 87.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1339 GetRequests, 1028 SyntacticMatches, 40 SemanticMatches, 271 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 90.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9512617043581153 AbsIntWeakeningRatio, 1.9183673469387754 AbsIntAvgWeakeningVarsNumRemoved, 95.6734693877551 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 71 PreInvPairs, 99 NumberOfFragments, 1721 HoareAnnotationTreeSize, 71 FomulaSimplifications, 4396 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14312 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1767 ConstructedInterpolants, 62 QuantifiedInterpolants, 780889 SizeOfPredicates, 91 NumberOfNonLiveVariables, 2927 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 672/834 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...