./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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 b18fe0627204ab4c483aeb119f16f48fd5019cde ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:10,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:19:10,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:19:10,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:19:10,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:19:10,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:19:10,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:19:10,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:19:10,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:19:10,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:19:10,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:19:10,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:19:10,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:19:10,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:19:10,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:19:10,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:19:10,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:19:10,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:19:10,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:19:10,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:19:10,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:19:10,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:19:10,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:19:10,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:19:10,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:19:10,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:19:10,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:19:10,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:19:10,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:19:10,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:19:10,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:19:10,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:19:10,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:19:10,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:19:10,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:19:10,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:19:10,849 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:19:10,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:19:10,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:19:10,860 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:19:10,860 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:19:10,860 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:19:10,860 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:19:10,860 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:19:10,860 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:19:10,861 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:19:10,861 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:19:10,861 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:19:10,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:19:10,862 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:19:10,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:19:10,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:19:10,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:19:10,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:19:10,865 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:19:10,865 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_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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 -> b18fe0627204ab4c483aeb119f16f48fd5019cde [2018-11-10 13:19:10,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:19:10,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:19:10,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:19:10,901 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:19:10,901 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:19:10,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:19:10,942 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/data/a48a6f71c/045fca93a36040958e1b2238b8ec8ca2/FLAGc23c11937 [2018-11-10 13:19:11,393 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:19:11,394 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:19:11,403 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/data/a48a6f71c/045fca93a36040958e1b2238b8ec8ca2/FLAGc23c11937 [2018-11-10 13:19:11,412 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/data/a48a6f71c/045fca93a36040958e1b2238b8ec8ca2 [2018-11-10 13:19:11,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:19:11,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:19:11,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:19:11,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:19:11,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:19:11,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfccf2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11, skipping insertion in model container [2018-11-10 13:19:11,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:19:11,454 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:19:11,649 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:19:11,656 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:19:11,688 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:19:11,712 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:19:11,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11 WrapperNode [2018-11-10 13:19:11,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:19:11,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:19:11,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:19:11,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:19:11,757 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:19:11" (1/1) ... [2018-11-10 13:19:11,769 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:19:11" (1/1) ... [2018-11-10 13:19:11,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:19:11,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:19:11,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:19:11,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:19:11,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... [2018-11-10 13:19:11,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:19:11,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:19:11,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:19:11,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:19:11,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:19:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-10 13:19:11,840 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-10 13:19:11,840 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 13:19:11,840 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 13:19:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-10 13:19:11,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-10 13:19:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:19:11,841 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 13:19:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 13:19:11,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 13:19:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 13:19:11,841 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 13:19:11,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:19:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:19:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:19:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:19:11,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:19:11,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:19:12,070 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:19:12,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:12 BoogieIcfgContainer [2018-11-10 13:19:12,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:19:12,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:19:12,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:19:12,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:19:12,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:19:11" (1/3) ... [2018-11-10 13:19:12,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff82c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:19:12, skipping insertion in model container [2018-11-10 13:19:12,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:11" (2/3) ... [2018-11-10 13:19:12,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff82c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:19:12, skipping insertion in model container [2018-11-10 13:19:12,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:12" (3/3) ... [2018-11-10 13:19:12,075 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:19:12,081 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:19:12,086 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:19:12,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:19:12,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:19:12,115 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:19:12,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:19:12,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:19:12,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:19:12,115 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:19:12,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:19:12,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:19:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-10 13:19:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 13:19:12,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:12,131 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:19:12,133 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:12,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1923088159, now seen corresponding path program 1 times [2018-11-10 13:19:12,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:12,228 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:19:12,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:19:12,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:19:12,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:19:12,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:19:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:19:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:19:12,244 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-10 13:19:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:19:12,262 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-10 13:19:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:19:12,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-10 13:19:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:19:12,269 INFO L225 Difference]: With dead ends: 101 [2018-11-10 13:19:12,269 INFO L226 Difference]: Without dead ends: 47 [2018-11-10 13:19:12,272 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:19:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-10 13:19:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-10 13:19:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 13:19:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-10 13:19:12,300 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 26 [2018-11-10 13:19:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:19:12,300 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-10 13:19:12,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:19:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-10 13:19:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:19:12,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:12,301 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:19:12,302 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:12,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1742285523, now seen corresponding path program 1 times [2018-11-10 13:19:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:12,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:12,373 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:19:12,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:19:12,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:19:12,374 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:19:12,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:19:12,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:19:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:19:12,375 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-11-10 13:19:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:19:12,445 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-10 13:19:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:19:12,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-10 13:19:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:19:12,448 INFO L225 Difference]: With dead ends: 81 [2018-11-10 13:19:12,448 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 13:19:12,449 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:19:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 13:19:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-10 13:19:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 13:19:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 13:19:12,459 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-11-10 13:19:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:19:12,460 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 13:19:12,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:19:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-10 13:19:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 13:19:12,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:12,461 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:19:12,461 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:12,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1484108620, now seen corresponding path program 1 times [2018-11-10 13:19:12,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:12,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:12,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:12,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:19:12,562 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-10 13:19:12,564 INFO L202 CegarAbsIntRunner]: [4], [5], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [73], [74], [75], [77], [81], [84], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [140], [141] [2018-11-10 13:19:12,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:19:12,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:19:13,012 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:19:13,014 INFO L272 AbstractInterpreter]: Visited 25 different actions 61 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:19:13,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:13,027 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:19:13,226 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 81.57% of their original sizes. [2018-11-10 13:19:13,227 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:19:13,680 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-10 13:19:13,680 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:19:13,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:19:13,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-10 13:19:13,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:19:13,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 13:19:13,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 13:19:13,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-10 13:19:13,682 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 17 states. [2018-11-10 13:19:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:19:14,808 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-10 13:19:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:19:14,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-10 13:19:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:19:14,809 INFO L225 Difference]: With dead ends: 70 [2018-11-10 13:19:14,809 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 13:19:14,810 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:19:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 13:19:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-10 13:19:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 13:19:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-10 13:19:14,819 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2018-11-10 13:19:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:19:14,819 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-10 13:19:14,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 13:19:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-10 13:19:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 13:19:14,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:14,821 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:19:14,821 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:14,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1486894025, now seen corresponding path program 1 times [2018-11-10 13:19:14,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:14,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:14,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:14,889 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:19:14,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:14,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:19:14,894 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-10 13:19:14,895 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:19:14,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:19:14,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:19:15,046 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:19:15,046 INFO L272 AbstractInterpreter]: Visited 34 different actions 80 times. Merged at 11 different actions 21 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-10 13:19:15,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:15,050 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:19:15,208 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 70% of their original sizes. [2018-11-10 13:19:15,209 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:19:17,842 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-11-10 13:19:17,842 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:19:17,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:19:17,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [6] total 28 [2018-11-10 13:19:17,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:19:17,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 13:19:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 13:19:17,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:19:17,844 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 24 states. [2018-11-10 13:19:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:19:22,032 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-10 13:19:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:19:22,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-11-10 13:19:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:19:22,033 INFO L225 Difference]: With dead ends: 83 [2018-11-10 13:19:22,034 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 13:19:22,034 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2018-11-10 13:19:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 13:19:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-10 13:19:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 13:19:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-10 13:19:22,054 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 49 [2018-11-10 13:19:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:19:22,054 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-10 13:19:22,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 13:19:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-10 13:19:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 13:19:22,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:22,056 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:19:22,056 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:22,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -335728544, now seen corresponding path program 1 times [2018-11-10 13:19:22,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:22,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:22,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:22,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:19:22,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:22,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:19:22,139 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-10 13:19:22,139 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:19:22,141 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:19:22,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:19:22,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:19:22,466 INFO L272 AbstractInterpreter]: Visited 48 different actions 188 times. Merged at 25 different actions 75 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-10 13:19:22,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:22,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:19:22,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:22,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:19:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:22,474 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:19:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:22,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:19:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:19:22,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:19:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:19:22,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:19:22,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-10 13:19:22,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:19:22,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:19:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:19:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:19:22,668 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 6 states. [2018-11-10 13:19:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:19:22,740 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-11-10 13:19:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:19:22,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-10 13:19:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:19:22,741 INFO L225 Difference]: With dead ends: 122 [2018-11-10 13:19:22,741 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 13:19:22,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:19:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 13:19:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-10 13:19:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 13:19:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-10 13:19:22,771 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 61 [2018-11-10 13:19:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:19:22,771 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-10 13:19:22,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:19:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-10 13:19:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 13:19:22,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:19:22,773 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, 1, 1, 1, 1, 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:19:22,773 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:19:22,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:19:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1181995647, now seen corresponding path program 2 times [2018-11-10 13:19:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:19:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:19:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:19:22,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:19:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:19:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:23,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:23,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:19:23,441 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:19:23,441 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:19:23,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:19:23,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:19:23,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:19:23,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:19:23,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 13:19:23,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:19:23,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:19:23,512 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:19:23,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 13:19:23,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:19:23,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:19:23,600 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:19:23,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 13:19:23,624 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 13 treesize of output 10 [2018-11-10 13:19:23,625 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 10 treesize of output 9 [2018-11-10 13:19:23,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:23,645 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:19:23,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-10 13:19:25,801 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int) (v_main_~s~0.offset_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (+ v_main_~s~0.offset_BEFORE_CALL_1 4)) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-11-10 13:19:28,561 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 13:19:28,568 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:19:28,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:19:28,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:28,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:28,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:19:28,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-11-10 13:19:32,613 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-10 13:19:32,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:19:32,666 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 11 treesize of output 7 [2018-11-10 13:19:32,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:32,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:32,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:19:32,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:14 [2018-11-10 13:19:36,708 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 13:19:38,746 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 13:19:40,787 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-10 13:19:40,792 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_2 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ v_main_~s~0.offset_BEFORE_CALL_2 4))))) (exists ((|sll_update_at_write~int_#ptr.offset| Int) (|sll_update_at_write~int_#value| Int)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) |sll_update_at_write~int_#ptr.offset| |sll_update_at_write~int_#value|))) |c_#memory_int|))) is different from true [2018-11-10 13:19:40,807 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 44 [2018-11-10 13:19:40,810 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 40 treesize of output 36 [2018-11-10 13:19:40,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,833 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 32 treesize of output 20 [2018-11-10 13:19:40,834 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:19:40,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-11-10 13:19:40,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 13:19:40,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-10 13:19:40,898 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 31 treesize of output 28 [2018-11-10 13:19:40,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:19:40,900 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-10 13:19:40,909 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:19:40,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-10 13:19:40,917 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:19:40,917 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,921 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:40,938 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:57, output treesize:14 [2018-11-10 13:19:41,151 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 29 treesize of output 29 [2018-11-10 13:19:41,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:19:41,155 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 21 treesize of output 10 [2018-11-10 13:19:41,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:41,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:41,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:41,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:10 [2018-11-10 13:19:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-11-10 13:19:41,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:19:42,064 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 13:19:42,068 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:42,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:42,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:47,213 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 65 [2018-11-10 13:19:47,216 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:47,220 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:47,226 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:47,812 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:47,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:19:54,706 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 43 treesize of output 37 [2018-11-10 13:19:54,718 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:19:54,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 13:19:54,731 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 3 [2018-11-10 13:19:54,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 13:19:54,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 13:19:54,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,745 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:19:54,761 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 43 treesize of output 37 [2018-11-10 13:19:54,772 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:19:54,773 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 13:19:54,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 13:19:54,785 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,787 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 13:19:54,792 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 3 [2018-11-10 13:19:54,793 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,794 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,802 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:19:54,822 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:19:54,822 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:87, output treesize:43 [2018-11-10 13:19:54,953 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 55 treesize of output 48 [2018-11-10 13:19:54,970 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:19:54,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,979 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 18 treesize of output 22 [2018-11-10 13:19:54,983 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 14 treesize of output 14 [2018-11-10 13:19:54,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:19:54,990 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 17 treesize of output 15 [2018-11-10 13:19:54,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:54,998 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 10 treesize of output 3 [2018-11-10 13:19:54,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:55,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:19:55,007 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:19:55,022 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 55 treesize of output 48 [2018-11-10 13:19:55,034 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:19:55,034 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:55,044 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 18 treesize of output 22 [2018-11-10 13:19:55,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 17 treesize of output 15 [2018-11-10 13:19:55,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:55,053 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 10 treesize of output 3 [2018-11-10 13:19:55,053 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 13:19:55,061 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 14 treesize of output 14 [2018-11-10 13:19:55,061 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 13:19:55,065 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:19:55,070 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:19:55,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:19:55,080 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:111, output treesize:57 [2018-11-10 13:19:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:19:55,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:19:55,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 28] total 75 [2018-11-10 13:19:55,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:19:55,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-10 13:19:55,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-10 13:19:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=5019, Unknown=13, NotChecked=286, Total=5550 [2018-11-10 13:19:55,595 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 57 states. [2018-11-10 13:20:34,708 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 13:20:40,771 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-11-10 13:20:49,386 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-11-10 13:20:51,555 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 13:20:53,616 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 13:20:57,896 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2018-11-10 13:21:00,240 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 13:21:04,313 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-11-10 13:21:06,499 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 13:21:09,302 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 13:21:11,410 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-10 13:21:13,972 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 13:21:16,254 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 13:21:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:16,783 INFO L93 Difference]: Finished difference Result 187 states and 234 transitions. [2018-11-10 13:21:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 13:21:16,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 71 [2018-11-10 13:21:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:16,785 INFO L225 Difference]: With dead ends: 187 [2018-11-10 13:21:16,785 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 13:21:16,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=780, Invalid=11853, Unknown=31, NotChecked=446, Total=13110 [2018-11-10 13:21:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 13:21:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 129. [2018-11-10 13:21:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 13:21:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2018-11-10 13:21:16,827 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 71 [2018-11-10 13:21:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:16,827 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2018-11-10 13:21:16,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-10 13:21:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2018-11-10 13:21:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 13:21:16,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:16,829 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:21:16,829 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:16,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1432767707, now seen corresponding path program 1 times [2018-11-10 13:21:16,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:16,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:16,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:21:16,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:16,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:16,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-10 13:21:16,891 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:21:16,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:21:16,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:21:17,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:21:17,319 INFO L272 AbstractInterpreter]: Visited 49 different actions 191 times. Merged at 25 different actions 75 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-10 13:21:17,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:17,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:21:17,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:17,327 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:21:17,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:17,341 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:21:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:17,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:21:17,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 13:21:17,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:21:17,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-11-10 13:21:17,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:21:17,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:21:17,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:21:17,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:21:17,495 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 5 states. [2018-11-10 13:21:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:17,588 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-10 13:21:17,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:21:17,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-10 13:21:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:17,592 INFO L225 Difference]: With dead ends: 174 [2018-11-10 13:21:17,592 INFO L226 Difference]: Without dead ends: 143 [2018-11-10 13:21:17,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:21:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-10 13:21:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-11-10 13:21:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 13:21:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2018-11-10 13:21:17,646 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 73 [2018-11-10 13:21:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:17,646 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2018-11-10 13:21:17,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:21:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2018-11-10 13:21:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 13:21:17,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:17,648 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, 1, 1, 1, 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:21:17,648 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:17,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1459663719, now seen corresponding path program 3 times [2018-11-10 13:21:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:17,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:17,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 13:21:17,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:17,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:17,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:17,732 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:21:17,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:17,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:21:17,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:21:17,749 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:21:17,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:21:17,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:21:17,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:21:17,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 13:21:18,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:21:18,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-10 13:21:18,005 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:21:18,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:21:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:21:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:21:18,006 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand 8 states. [2018-11-10 13:21:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:18,213 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2018-11-10 13:21:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:21:18,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-11-10 13:21:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:18,215 INFO L225 Difference]: With dead ends: 244 [2018-11-10 13:21:18,215 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 13:21:18,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:21:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 13:21:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2018-11-10 13:21:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 13:21:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-11-10 13:21:18,267 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 73 [2018-11-10 13:21:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:18,268 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-11-10 13:21:18,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:21:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-11-10 13:21:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 13:21:18,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:18,269 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, 1, 1, 1, 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:21:18,269 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:18,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1109360473, now seen corresponding path program 4 times [2018-11-10 13:21:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:21:18,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:18,322 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:18,323 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:18,323 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:21:18,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:18,323 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:21:18,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:18,356 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:21:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:18,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:21:18,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:21:18,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:21:18,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-10 13:21:18,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:21:18,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:21:18,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:21:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:21:18,509 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-11-10 13:21:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:18,579 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2018-11-10 13:21:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:21:18,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-11-10 13:21:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:18,581 INFO L225 Difference]: With dead ends: 216 [2018-11-10 13:21:18,581 INFO L226 Difference]: Without dead ends: 129 [2018-11-10 13:21:18,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:21:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-10 13:21:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-11-10 13:21:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 13:21:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2018-11-10 13:21:18,612 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 73 [2018-11-10 13:21:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:18,612 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2018-11-10 13:21:18,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:21:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2018-11-10 13:21:18,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 13:21:18,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:18,614 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:21:18,614 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:18,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1135399108, now seen corresponding path program 5 times [2018-11-10 13:21:18,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 13:21:18,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:18,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:18,689 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:18,690 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:21:18,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:18,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:21:18,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:21:18,700 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:21:18,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:21:18,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:21:18,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 13:21:18,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 13:21:18,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:21:18,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 10 [2018-11-10 13:21:18,840 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:21:18,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:21:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:21:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:21:18,841 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 7 states. [2018-11-10 13:21:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:18,925 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-11-10 13:21:18,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:21:18,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-11-10 13:21:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:18,927 INFO L225 Difference]: With dead ends: 175 [2018-11-10 13:21:18,927 INFO L226 Difference]: Without dead ends: 147 [2018-11-10 13:21:18,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:21:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-10 13:21:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2018-11-10 13:21:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 13:21:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2018-11-10 13:21:18,959 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 81 [2018-11-10 13:21:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:18,960 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2018-11-10 13:21:18,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:21:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2018-11-10 13:21:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 13:21:18,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:18,961 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, 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:21:18,961 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:18,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 400725493, now seen corresponding path program 1 times [2018-11-10 13:21:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:18,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:21:19,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:19,015 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:19,015 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2018-11-10 13:21:19,015 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], [109], [111], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-11-10 13:21:19,017 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:21:19,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:21:19,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:21:19,298 INFO L272 AbstractInterpreter]: Visited 50 different actions 228 times. Merged at 27 different actions 93 times. Widened at 1 different actions 2 times. Found 15 fixpoints after 7 different actions. Largest state had 42 variables. [2018-11-10 13:21:19,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:19,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:21:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:19,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/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:21:19,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:19,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:21:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:19,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:21:19,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:21:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:21:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-11-10 13:21:19,466 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:21:19,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:21:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:21:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:21:19,467 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 6 states. [2018-11-10 13:21:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:19,531 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2018-11-10 13:21:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:21:19,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-10 13:21:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:19,533 INFO L225 Difference]: With dead ends: 168 [2018-11-10 13:21:19,533 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 13:21:19,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:21:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 13:21:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2018-11-10 13:21:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 13:21:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2018-11-10 13:21:19,566 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 83 [2018-11-10 13:21:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:19,566 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2018-11-10 13:21:19,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:21:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2018-11-10 13:21:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 13:21:19,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:19,567 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:21:19,568 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:19,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:19,568 INFO L82 PathProgramCache]: Analyzing trace with hash -614108901, now seen corresponding path program 1 times [2018-11-10 13:21:19,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:19,569 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:21:20,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:20,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:20,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-10 13:21:20,334 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:21:20,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:21:20,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:21:20,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:21:20,859 INFO L272 AbstractInterpreter]: Visited 51 different actions 284 times. Merged at 32 different actions 136 times. Widened at 2 different actions 2 times. Found 26 fixpoints after 8 different actions. Largest state had 42 variables. [2018-11-10 13:21:20,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:20,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:21:20,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:20,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:20,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:20,890 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:21:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:20,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:20,975 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:21:20,976 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:21:20,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:20,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:20,983 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:21:20,984 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:21:20,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:20,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:20,990 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:21:20,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-10 13:21:21,183 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:21:21,184 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:21:21,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-10 13:21:21,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-11-10 13:21:21,675 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 44 treesize of output 42 [2018-11-10 13:21:21,676 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:21:21,688 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 42 treesize of output 38 [2018-11-10 13:21:21,689 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:21:21,700 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 34 [2018-11-10 13:21:21,700 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:21:21,711 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:21:21,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-10 13:21:21,729 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:21:21,729 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:21:21,738 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:21:21,738 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:21:21,744 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:21:21,750 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 34 treesize of output 36 [2018-11-10 13:21:21,751 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:21:21,752 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:21:21,763 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 32 treesize of output 28 [2018-11-10 13:21:21,763 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:21:21,773 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 28 treesize of output 26 [2018-11-10 13:21:21,773 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:21:21,786 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:21:21,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:21:21,807 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:21:21,807 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,809 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,815 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 26 treesize of output 28 [2018-11-10 13:21:21,817 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 24 treesize of output 19 [2018-11-10 13:21:21,817 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-10 13:21:21,830 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,881 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 20 treesize of output 8 [2018-11-10 13:21:21,882 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,888 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,889 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 26 treesize of output 20 [2018-11-10 13:21:21,892 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:21:21,893 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,896 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:21,901 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:21:21,901 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2018-11-10 13:21:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 13:21:21,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:22,470 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 19 treesize of output 11 [2018-11-10 13:21:22,472 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 11 treesize of output 3 [2018-11-10 13:21:22,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:21:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:21:22,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:21:22,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:22 [2018-11-10 13:21:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:21:22,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:21:22,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 24, 16] total 66 [2018-11-10 13:21:22,741 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:21:22,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 13:21:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 13:21:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4081, Unknown=0, NotChecked=0, Total=4290 [2018-11-10 13:21:22,742 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 55 states. [2018-11-10 13:21:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:27,003 INFO L93 Difference]: Finished difference Result 248 states and 296 transitions. [2018-11-10 13:21:27,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-10 13:21:27,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 85 [2018-11-10 13:21:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:27,005 INFO L225 Difference]: With dead ends: 248 [2018-11-10 13:21:27,005 INFO L226 Difference]: Without dead ends: 246 [2018-11-10 13:21:27,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 140 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1189, Invalid=14311, Unknown=0, NotChecked=0, Total=15500 [2018-11-10 13:21:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-10 13:21:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 171. [2018-11-10 13:21:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 13:21:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2018-11-10 13:21:27,049 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 85 [2018-11-10 13:21:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:27,049 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2018-11-10 13:21:27,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 13:21:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2018-11-10 13:21:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 13:21:27,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:27,050 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:21:27,050 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:27,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:27,050 INFO L82 PathProgramCache]: Analyzing trace with hash -912385343, now seen corresponding path program 2 times [2018-11-10 13:21:27,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:27,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:21:27,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:21:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:27,112 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:27,112 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:21:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,112 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:27,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:21:27,129 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:21:27,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 13:21:27,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:21:27,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:21:27,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:21:27,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:21:27,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-10 13:21:27,275 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:21:27,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:21:27,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:21:27,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:21:27,275 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 8 states. [2018-11-10 13:21:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:27,371 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2018-11-10 13:21:27,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:21:27,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-10 13:21:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:27,373 INFO L225 Difference]: With dead ends: 249 [2018-11-10 13:21:27,373 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 13:21:27,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:21:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 13:21:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2018-11-10 13:21:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 13:21:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2018-11-10 13:21:27,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 87 [2018-11-10 13:21:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:27,435 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2018-11-10 13:21:27,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:21:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2018-11-10 13:21:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:21:27,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:27,437 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:21:27,437 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:27,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash -379857773, now seen corresponding path program 6 times [2018-11-10 13:21:27,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:27,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:27,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 13:21:27,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:27,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:27,493 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:21:27,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:27,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:21:27,507 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:21:27,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:21:27,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:21:27,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 13:21:27,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 13:21:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:21:27,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2018-11-10 13:21:27,645 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:21:27,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:21:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:21:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:21:27,646 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand 6 states. [2018-11-10 13:21:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:27,710 INFO L93 Difference]: Finished difference Result 231 states and 255 transitions. [2018-11-10 13:21:27,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:21:27,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-10 13:21:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:27,711 INFO L225 Difference]: With dead ends: 231 [2018-11-10 13:21:27,711 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 13:21:27,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-10 13:21:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 13:21:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-10 13:21:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 13:21:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2018-11-10 13:21:27,756 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 93 [2018-11-10 13:21:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:27,756 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2018-11-10 13:21:27,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:21:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2018-11-10 13:21:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:21:27,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:21:27,758 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:21:27,758 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:21:27,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:21:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1545646409, now seen corresponding path program 3 times [2018-11-10 13:21:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:21:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:21:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:21:27,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:21:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:21:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 13:21:27,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:21:27,834 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:21:27,834 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:21:27,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:21:27,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:21:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:21:27,844 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:21:27,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:21:27,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:21:27,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:21:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:21:27,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:21:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 13:21:27,966 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:21:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-10 13:21:27,966 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:21:27,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:21:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:21:27,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:21:27,967 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 6 states. [2018-11-10 13:21:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:21:28,018 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-11-10 13:21:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:21:28,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-10 13:21:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:21:28,019 INFO L225 Difference]: With dead ends: 149 [2018-11-10 13:21:28,019 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:21:28,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:21:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:21:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:21:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:21:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:21:28,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2018-11-10 13:21:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:21:28,021 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:21:28,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:21:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:21:28,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:21:28,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:21:28,179 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 191 [2018-11-10 13:21:28,576 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 492 [2018-11-10 13:21:28,801 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 494 DAG size of output: 494 [2018-11-10 13:21:29,248 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 580 DAG size of output: 579 [2018-11-10 13:21:29,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:21:29,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:21:29,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:21:29,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:21:29,742 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 560 DAG size of output: 549 [2018-11-10 13:21:30,034 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 362 [2018-11-10 13:21:30,233 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 30 [2018-11-10 13:21:30,817 WARN L179 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 54 [2018-11-10 13:21:30,958 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 33 [2018-11-10 13:21:53,542 WARN L179 SmtUtils]: Spent 22.58 s on a formula simplification. DAG size of input: 504 DAG size of output: 89 [2018-11-10 13:21:56,823 WARN L179 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 516 DAG size of output: 101 [2018-11-10 13:21:57,830 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 276 DAG size of output: 74 [2018-11-10 13:21:58,330 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 65 [2018-11-10 13:22:06,616 WARN L179 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2018-11-10 13:22:07,566 WARN L179 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 490 DAG size of output: 59 [2018-11-10 13:22:20,183 WARN L179 SmtUtils]: Spent 12.62 s on a formula simplification. DAG size of input: 280 DAG size of output: 58 [2018-11-10 13:22:21,311 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 304 DAG size of output: 69 [2018-11-10 13:22:21,313 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-10 13:22:21,313 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:22:21,313 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-10 13:22:21,313 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:22:21,313 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:22:21,313 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-10 13:22:21,314 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse1 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse0 (= |#memory_int| |old(#memory_int)|))) (or (and (and (or (<= (+ sll_update_at_~index |sll_update_at_#in~data|) 2) (and (<= (+ sll_update_at_~head.offset 3) |sll_update_at_#in~data|) (<= (+ sll_update_at_~index sll_update_at_~head.offset) 1))) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset)) .cse0 .cse1 (<= |sll_update_at_#in~index| sll_update_at_~index)) (or (let ((.cse2 (= |sll_update_at_#in~head.base| 0)) (.cse3 (< |#NULL.base| |sll_update_at_#in~head.offset|))) (and (or (< (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~data|) 2) .cse2 .cse3 (< (+ |#NULL.offset| 2) |sll_update_at_#in~data|) (< 0 (* 2 |#NULL.offset|)) (< 0 (+ |#NULL.base| |sll_update_at_#in~index|)) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 2)) (or .cse2 .cse3 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< |#NULL.offset| |#NULL.base|) (not (= |sll_update_at_#in~index| 1)) (< 3 (+ |#NULL.offset| |sll_update_at_#in~data|)) (< |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2))))) (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ v_main_~s~0.offset_BEFORE_CALL_2 4)) v_main_~s~0.base_BEFORE_CALL_2))) (let ((.cse4 (+ |sll_update_at_#in~head.offset| 4))) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse4)) (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse1 (<= 1 |sll_update_at_#in~index|) (and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse4) sll_update_at_~head.base) .cse0))))) [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:22:21,314 INFO L425 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L421 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (or (let ((.cse0 (= |sll_update_at_#in~head.base| 0)) (.cse1 (< |#NULL.base| |sll_update_at_#in~head.offset|))) (and (or (< (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~data|) 2) .cse0 .cse1 (< (+ |#NULL.offset| 2) |sll_update_at_#in~data|) (< 0 (* 2 |#NULL.offset|)) (< 0 (+ |#NULL.base| |sll_update_at_#in~index|)) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 2)) (or .cse0 .cse1 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< |#NULL.offset| |#NULL.base|) (not (= |sll_update_at_#in~index| 1)) (< 3 (+ |#NULL.offset| |sll_update_at_#in~data|)) (< |sll_update_at_#in~data| (+ |sll_update_at_#in~index| 2))))) (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ v_main_~s~0.offset_BEFORE_CALL_2 4)) v_main_~s~0.base_BEFORE_CALL_2)))) [2018-11-10 13:22:21,315 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (and (= sll_create_~data 1) (<= sll_create_~len (+ |#NULL.offset| 2)) (<= (+ sll_create_~head~0.offset 1) sll_create_~data) (<= 0 (+ |#NULL.offset| sll_create_~head~0.offset)) (<= |sll_create_#in~data| (+ |#NULL.offset| 1)) (<= 1 (+ |#NULL.base| sll_create_~len)) (<= (+ |#NULL.offset| |#NULL.base|) 0)))) (or (and .cse0 (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|)) (< |#NULL.offset| |#NULL.base|) (< 3 (+ |sll_create_#in~data| |sll_create_#in~len|)) (and (and (= (select |#valid| sll_create_~head~0.base) 1) .cse0) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (+ 0 4)) sll_create_~head~0.offset)) (< 0 (* 2 |#NULL.offset|)) (< (+ |#NULL.base| |sll_create_#in~len|) 2) (< (+ |sll_create_#in~data| |#NULL.offset|) 1))) [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (let ((.cse5 (+ 0 4))) (let ((.cse0 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse1 (not (= sll_create_~head~0.base 0))) (.cse2 (let ((.cse9 (+ sll_create_~head~0.offset sll_create_~data))) (let ((.cse6 (<= 1 .cse9)) (.cse7 (<= .cse9 1))) (or (and .cse6 (<= (* 2 sll_create_~len) 4) .cse7 (<= 2 (+ sll_create_~data sll_create_~len))) (let ((.cse8 (+ sll_create_~head~0.offset sll_create_~len))) (and (<= 0 .cse8) .cse6 .cse7 (<= .cse8 1))))))) (.cse3 (= 0 sll_create_~head~0.offset)) (.cse4 (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) .cse5) sll_create_~head~0.offset))) (or (and (and (= sll_create_~data 1) (<= sll_create_~len (+ |#NULL.offset| 2)) (<= (+ sll_create_~head~0.offset 1) sll_create_~data) (<= 0 (+ |#NULL.offset| sll_create_~head~0.offset))) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|)) (and (<= |sll_create_#in~len| (+ sll_create_~len 1)) .cse0 .cse1 .cse2 .cse3 .cse4) (< |#NULL.offset| |#NULL.base|) (< 3 (+ |sll_create_#in~data| |sll_create_#in~len|)) (< 0 (* 2 |#NULL.offset|)) (< (+ |#NULL.base| |sll_create_#in~len|) 2) (and (and (<= sll_create_~head~0.base sll_create_~new_head~0.base) (<= sll_create_~new_head~0.base |sll_create_write~$Pointer$_#ptr.base|) (<= sll_create_~new_head~0.base sll_create_~head~0.base) (<= |sll_create_write~$Pointer$_#ptr.base| sll_create_~new_head~0.base) (<= sll_create_~new_head~0.offset |#NULL.base|) (<= (+ sll_create_~head~0.offset 4) |sll_create_write~$Pointer$_#ptr.offset|) (<= |sll_create_write~$Pointer$_#sizeOfWrittenType| (+ sll_create_~data 3)) (<= 0 (+ |#NULL.offset| sll_create_~new_head~0.offset)) (<= 5 (+ |sll_create_write~$Pointer$_#sizeOfWrittenType| sll_create_~data)) (<= (+ |sll_create_write~$Pointer$_#value.offset| |sll_create_#in~data|) 1) (<= |sll_create_write~$Pointer$_#ptr.offset| (+ |sll_create_write~$Pointer$_#value.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) .cse5) sll_create_~head~0.base)) .cse0 .cse1 .cse2 .cse3 .cse4) (< (+ |sll_create_#in~data| |#NULL.offset|) 1)))) [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-10 13:22:21,315 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)|)) (< |#NULL.offset| |#NULL.base|) (< 3 (+ |sll_create_#in~data| |sll_create_#in~len|)) (< 0 (* 2 |#NULL.offset|)) (< (+ |#NULL.base| |sll_create_#in~len|) 2) (< (+ |sll_create_#in~data| |#NULL.offset|) 1)) [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-10 13:22:21,315 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ |#NULL.base| |#NULL.offset|) 0) (= |#NULL.offset| 0) (<= |#NULL.offset| |#NULL.base|)) [2018-11-10 13:22:21,316 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L428 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point L589-1(lines 589 592) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L421 ceAbstractionStarter]: At program point L589-3(lines 589 592) the Hoare annotation is: (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (let ((.cse1 (+ |sll_get_data_at_#in~head.offset| 4))) (and .cse0 (<= 1 |sll_get_data_at_#in~index|) (= 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.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (< .cse2 2) (< 2 .cse2)))) (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ v_main_~s~0.offset_BEFORE_CALL_2 4)) v_main_~s~0.base_BEFORE_CALL_2)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (forall ((v_main_~s~0.base_BEFORE_CALL_7 Int)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) 4)) 3))) (and (<= 2 |sll_get_data_at_#in~index|) .cse0) (and (<= sll_get_data_at_~index |sll_get_data_at_#in~index|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (<= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point L589-4(lines 589 592) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-11-10 13:22:21,316 INFO L421 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse11 (+ 0 4))) (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse11) main_~s~0.base))) (.cse1 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse11) main_~s~0.offset)) (.cse2 (let ((.cse6 (not (= main_~s~0.base 0))) (.cse7 (<= (+ main_~s~0.offset main_~data~0) 1)) (.cse8 (<= main_~len~0 (+ |#NULL.offset| 2))) (.cse10 (<= 1 (+ |#NULL.offset| main_~data~0)))) (or (let ((.cse9 (+ main_~i~0 main_~data~0))) (and .cse6 .cse7 .cse8 (<= 4 (+ main_~new_data~0 main_~data~0)) (<= .cse9 2) (<= main_~new_data~0 (+ main_~s~0.offset 3)) (<= 2 .cse9) (<= main_~data~0 (+ |#NULL.base| 1)) .cse10)) (and .cse6 .cse7 (<= |#NULL.base| main_~i~0) .cse8 (<= (+ main_~i~0 main_~new_data~0) 2) (<= |#NULL.base| main_~s~0.offset) .cse10 (<= 4 (+ main_~new_data~0 main_~len~0)))))) (.cse3 (* 2 |#NULL.offset|))) (or (and .cse0 .cse1 .cse2 (= main_~i~0 0)) (< .cse3 0) (let ((.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse4 (+ main_~i~0 1))) (and .cse0 (<= .cse4 .cse5) .cse1 (<= .cse5 .cse4) .cse2 (<= 2 main_~len~0))) (< |#NULL.offset| |#NULL.base|) (< 0 .cse3) (< |#NULL.base| |#NULL.offset|)))) [2018-11-10 13:22:21,316 INFO L425 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point L611-3(lines 611 616) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L421 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (let ((.cse0 (+ main_~len~0 1)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse3 (= (select .cse8 (+ 0 4)) main_~s~0.offset)) (.cse1 (= main_~len~0 .cse6)) (.cse4 (<= main_~data~0 (+ |#NULL.base| 1))) (.cse5 (<= 1 (+ |#NULL.offset| main_~data~0))) (.cse2 (= (let ((.cse7 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7)) (select .cse8 .cse7))) .cse0))) (or (and (= .cse0 main_~new_data~0) .cse1 .cse2 (= 0 main_~s~0.offset) .cse3 (<= (* 2 main_~len~0) 4) .cse4 .cse5 (<= (+ |#NULL.offset| 2) main_~len~0) (= main_~i~0 0)) (not (= |#NULL.base| 0)) (and (<= 1 main_~i~0) (and .cse3 (and (<= main_~i~0 .cse6) .cse1 .cse4 .cse5) (= main_~s~0.offset 0) (= main_~len~0 2) .cse2)) (not (= |#NULL.offset| 0))))) [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L428 ceAbstractionStarter]: At program point L611-5(lines 611 616) the Hoare annotation is: true [2018-11-10 13:22:21,317 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (let ((.cse0 (* 2 |#NULL.offset|))) (or (and (<= (* 2 main_~len~0) 4) (= |#valid| |old(#valid)|) (<= main_~data~0 (+ |#NULL.base| 1)) (= |#memory_int| |old(#memory_int)|) (<= 1 (+ |#NULL.offset| main_~data~0)) (<= (+ |#NULL.offset| 2) main_~len~0)) (< .cse0 0) (< |#NULL.offset| |#NULL.base|) (< 0 .cse0) (< |#NULL.base| |#NULL.offset|))) [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L421 ceAbstractionStarter]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse15 (+ 0 4))) (let ((.cse6 (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse15)) (.cse9 (<= 1 (+ |#NULL.offset| main_~data~0))) (.cse10 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse15))) (let ((.cse0 (not (= .cse10 main_~s~0.base))) (.cse1 (let ((.cse11 (not (= main_~s~0.base 0))) (.cse12 (<= (+ main_~s~0.offset main_~data~0) 1)) (.cse13 (<= |#NULL.base| main_~s~0.offset))) (or (and .cse11 .cse12 (<= (+ main_~i~0 |#NULL.base|) 0) (<= |#NULL.base| main_~i~0) .cse13 .cse9) (let ((.cse14 (+ main_~i~0 main_~data~0))) (and .cse11 .cse12 (<= (+ |#NULL.offset| main_~new_data~0) 2) (<= .cse14 2) .cse13 (<= 2 .cse14) .cse9 (<= 4 (+ main_~new_data~0 main_~len~0))))))) (.cse3 (<= 2 main_~len~0)) (.cse4 (+ main_~i~0 1)) (.cse2 (= .cse6 main_~s~0.offset)) (.cse7 (<= (* 2 main_~len~0) 4)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~i~0 main_~len~0) 2) .cse3) (and .cse0 (<= .cse4 .cse5) .cse1 (= main_~s~0.offset .cse6) (<= .cse5 .cse4) .cse7 .cse3) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (let ((.cse8 (select (select |#memory_int| .cse10) .cse6))) (and (= (+ main_~len~0 1) main_~new_data~0) (= main_~len~0 .cse5) (<= .cse4 .cse8) (= 0 main_~s~0.offset) (<= 2 main_~i~0) .cse2 .cse7 (<= main_~data~0 (+ |#NULL.base| 1)) .cse9 (<= .cse8 (+ .cse5 1)))))))) [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 610) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-11-10 13:22:21,317 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L421 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: (let ((.cse0 (* 2 |#NULL.offset|))) (or (< .cse0 0) (< |#NULL.offset| |#NULL.base|) (< 0 .cse0) (< |#NULL.base| |#NULL.offset|))) [2018-11-10 13:22:21,318 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (let ((.cse0 (* 2 |#NULL.offset|))) (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (< .cse0 0) (< |#NULL.offset| |#NULL.base|) (< 0 .cse0) (< |#NULL.base| |#NULL.offset|))) [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L421 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse10 (+ 0 4)) (.cse9 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse8 (+ main_~len~0 1))) (let ((.cse7 (* 2 |#NULL.offset|)) (.cse1 (= (let ((.cse12 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse9 .cse12)) (select .cse11 .cse12))) .cse8)) (.cse3 (= 0 main_~s~0.offset)) (.cse4 (<= main_~data~0 (+ |#NULL.base| 1))) (.cse5 (<= 1 (+ |#NULL.offset| main_~data~0))) (.cse2 (select .cse11 .cse10)) (.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse6 (<= (+ |#NULL.offset| 2) main_~len~0))) (or (and (and (= main_~len~0 .cse0) .cse1 (= main_~s~0.offset .cse2) .cse3 (= 3 main_~expected~0) (= main_~i~0 1) .cse4 .cse5 .cse6) (<= main_~len~0 2)) (< .cse7 0) (< |#NULL.offset| |#NULL.base|) (< 0 .cse7) (< |#NULL.base| |#NULL.offset|) (and (= .cse8 main_~new_data~0) .cse1 (= main_~expected~0 .cse0) .cse3 (= .cse2 main_~s~0.offset) (<= main_~expected~0 2) .cse4 .cse5 (<= (select (select |#memory_int| (select .cse9 .cse10)) .cse2) (+ .cse0 1)) .cse6 (= main_~i~0 0))))) [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point L613-2(lines 613 615) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 616) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-11-10 13:22:21,318 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (or (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (not (= |node_create_#in~data| 1))) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|))) [2018-11-10 13:22:21,318 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:22:21,319 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 13:22:21,319 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:22:21,319 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:22:21,319 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:22:21,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,325 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,332 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,336 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,337 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,337 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:22:21,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,337 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:22:21,337 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,338 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,338 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:22:21,338 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,338 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:22:21,338 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,338 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:22:21,339 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,339 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:22:21,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,340 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,341 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,341 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,342 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:22:21,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,342 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:22:21,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,342 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,342 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:22:21,342 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,343 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:22:21,343 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,343 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:22:21,343 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,343 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:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,346 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:22:21,347 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,347 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:22:21,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,350 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:22:21,350 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,351 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:22:21,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,352 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,353 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,362 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,363 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,372 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,373 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,374 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,374 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,374 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,381 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,381 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:22:21 BoogieIcfgContainer [2018-11-10 13:22:21,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:22:21,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:22:21,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:22:21,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:22:21,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:19:12" (3/4) ... [2018-11-10 13:22:21,386 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:22:21,391 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 13:22:21,391 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:22:21,391 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-10 13:22:21,391 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-11-10 13:22:21,391 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-10 13:22:21,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-11-10 13:22:21,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:22:21,392 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 13:22:21,396 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2018-11-10 13:22:21,396 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-10 13:22:21,396 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 13:22:21,418 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((data == 1 && len <= #NULL + 2) && head + 1 <= data) && 0 <= #NULL + head) && \valid == \old(\valid)) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || (((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && ((((1 <= head + data && 2 * len <= 4) && head + data <= 1) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && head + data <= 1) && head + len <= 1))) && 0 == head) && #memory_$Pointer$[head][0 + 4] == head)) || #NULL < #NULL) || 3 < \old(data) + \old(len)) || 0 < 2 * #NULL) || #NULL + \old(len) < 2) || ((((((((((((((((head <= new_head && new_head <= write~$Pointer$_#ptr) && new_head <= head) && write~$Pointer$_#ptr <= new_head) && new_head <= #NULL) && head + 4 <= write~$Pointer$_#ptr) && unknown-#sizeOfWrittenType-unknown <= data + 3) && 0 <= #NULL + new_head) && 5 <= unknown-#sizeOfWrittenType-unknown + data) && #value + \old(data) <= 1) && write~$Pointer$_#ptr <= #value + 4) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[head] == 1) && !(head == 0)) && ((((1 <= head + data && 2 * len <= 4) && head + data <= 1) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && head + data <= 1) && head + len <= 1))) && 0 == head) && #memory_$Pointer$[head][0 + 4] == head)) || \old(data) + #NULL < 1 [2018-11-10 13:22:21,418 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((index + \old(data) <= 2 || (head + 3 <= \old(data) && index + head <= 1)) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data)) && \old(index) <= index) || (((((((head + \old(data) < 2 || head == 0) || #NULL < head) || #NULL + 2 < \old(data)) || 0 < 2 * #NULL) || 0 < #NULL + \old(index)) || \old(index) + \old(data) < 2) && ((((((head == 0 || #NULL < head) || head + 1 < \old(index)) || #NULL < #NULL) || !(\old(index) == 1)) || 3 < #NULL + \old(data)) || \old(data) < \old(index) + 2)) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2 + 4] == v_main_~s~0.base_BEFORE_CALL_2)) || ((((head == #memory_$Pointer$[head][head + 4] && index + 1 <= \old(index)) && data == \old(data)) && 1 <= \old(index)) && #memory_$Pointer$[head][head + 4] == head && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) [2018-11-10 13:22:21,419 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((index + 1 <= \old(index) && 1 <= \old(index)) && head == #memory_$Pointer$[head][head + 4]) && head == #memory_$Pointer$[head][head + 4]) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3])) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2 + 4] == v_main_~s~0.base_BEFORE_CALL_2)) || !(#NULL == 0)) || !(#NULL == 0)) || (forall v_main_~s~0.base_BEFORE_CALL_7 : int :: !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][4]] == 3))) || (2 <= \old(index) && index + 1 <= \old(index))) || (((index <= \old(index) && head == head) && head == head) && \old(index) <= index) [2018-11-10 13:22:21,444 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a05a33f-a23c-4e43-b719-a80dcd9d3ce6/bin-2019/utaipan/witness.graphml [2018-11-10 13:22:21,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:22:21,445 INFO L168 Benchmark]: Toolchain (without parser) took 190030.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 957.5 MB in the beginning and 924.0 MB in the end (delta: 33.5 MB). Peak memory consumption was 433.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:22:21,446 INFO L168 Benchmark]: CDTParser took 0.17 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:22:21,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.76 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 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:22:21,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:22:21,446 INFO L168 Benchmark]: Boogie Preprocessor took 19.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:22:21,446 INFO L168 Benchmark]: RCFGBuilder took 265.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:22:21,447 INFO L168 Benchmark]: TraceAbstraction took 189310.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 924.0 MB in the end (delta: 204.9 MB). Peak memory consumption was 723.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:22:21,447 INFO L168 Benchmark]: Witness Printer took 62.28 ms. Allocated memory is still 1.4 GB. Free memory is still 924.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:22:21,448 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 296.76 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 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 72.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189310.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.3 MB). Free memory was 1.1 GB in the beginning and 924.0 MB in the end (delta: 204.9 MB). Peak memory consumption was 723.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.28 ms. Allocated memory is still 1.4 GB. Free memory is still 924.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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_~s~0.offset_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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.offset_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,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_7,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 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.offset_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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.offset_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,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_7,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.offset_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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[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.offset_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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #sizeOfWrittenType - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #sizeOfWrittenType - GenericResult: Unfinished Backtranslation unknown boogie variable #value - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #value - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #sizeOfWrittenType - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #sizeOfWrittenType - GenericResult: Unfinished Backtranslation unknown boogie variable #value - GenericResult: Unfinished Backtranslation unknown boogie variable write~$Pointer$_#ptr - GenericResult: Unfinished Backtranslation unknown boogie variable #value - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - 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 #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * 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:22:21,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,455 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,455 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,457 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,458 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,459 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,459 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,459 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,459 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,461 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((((((len + 1 == new_data && len == unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && 0 == s) && #memory_$Pointer$[s][0 + 4] == s) && 2 * len <= 4) && data <= #NULL + 1) && 1 <= #NULL + data) && #NULL + 2 <= len) && i == 0) || !(#NULL == 0)) || (1 <= i && (((#memory_$Pointer$[s][0 + 4] == s && ((i <= unknown-#memory_int-unknown[s][s] && len == unknown-#memory_int-unknown[s][s]) && data <= #NULL + 1) && 1 <= #NULL + data) && s == 0) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1)) || !(#NULL == 0) - InvariantResult [Line: 589]: Loop Invariant [2018-11-10 13:22:21,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,466 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,466 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:22:21,466 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,466 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:22:21,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,467 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:22:21,467 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,467 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:22:21,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,467 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:22:21,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,467 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:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,469 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:22:21,470 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,471 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:22:21,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:22:21,471 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,471 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:22:21,471 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,471 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:22:21,471 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,471 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:22:21,472 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,472 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:22:21,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,473 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((index + 1 <= \old(index) && 1 <= \old(index)) && head == #memory_$Pointer$[head][head + 4]) && head == #memory_$Pointer$[head][head + 4]) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3])) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2 + 4] == v_main_~s~0.base_BEFORE_CALL_2)) || !(#NULL == 0)) || !(#NULL == 0)) || (forall v_main_~s~0.base_BEFORE_CALL_7 : int :: !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][4]] == 3))) || (2 <= \old(index) && index + 1 <= \old(index))) || (((index <= \old(index) && head == head) && head == head) && \old(index) <= index) - InvariantResult [Line: 596]: Loop Invariant [2018-11-10 13:22:21,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,474 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:22:21,474 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,474 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:22:21,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,474 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,476 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,477 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:22:21,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:22:21,477 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:22:21,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,477 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,477 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,477 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((index + \old(data) <= 2 || (head + 3 <= \old(data) && index + head <= 1)) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data)) && \old(index) <= index) || (((((((head + \old(data) < 2 || head == 0) || #NULL < head) || #NULL + 2 < \old(data)) || 0 < 2 * #NULL) || 0 < #NULL + \old(index)) || \old(index) + \old(data) < 2) && ((((((head == 0 || #NULL < head) || head + 1 < \old(index)) || #NULL < #NULL) || !(\old(index) == 1)) || 3 < #NULL + \old(data)) || \old(data) < \old(index) + 2)) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2 + 4] == v_main_~s~0.base_BEFORE_CALL_2)) || ((((head == #memory_$Pointer$[head][head + 4] && index + 1 <= \old(index)) && data == \old(data)) && 1 <= \old(index)) && #memory_$Pointer$[head][head + 4] == head && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) - InvariantResult [Line: 574]: Loop Invariant [2018-11-10 13:22:21,479 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,480 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,480 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,480 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,481 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,482 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,483 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #sizeOfWrittenType [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable write~$Pointer$_#ptr [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #value [2018-11-10 13:22:21,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((((((data == 1 && len <= #NULL + 2) && head + 1 <= data) && 0 <= #NULL + head) && \valid == \old(\valid)) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || (((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && ((((1 <= head + data && 2 * len <= 4) && head + data <= 1) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && head + data <= 1) && head + len <= 1))) && 0 == head) && #memory_$Pointer$[head][0 + 4] == head)) || #NULL < #NULL) || 3 < \old(data) + \old(len)) || 0 < 2 * #NULL) || #NULL + \old(len) < 2) || ((((((((((((((((head <= new_head && new_head <= write~$Pointer$_#ptr) && new_head <= head) && write~$Pointer$_#ptr <= new_head) && new_head <= #NULL) && head + 4 <= write~$Pointer$_#ptr) && unknown-#sizeOfWrittenType-unknown <= data + 3) && 0 <= #NULL + new_head) && 5 <= unknown-#sizeOfWrittenType-unknown + data) && #value + \old(data) <= 1) && write~$Pointer$_#ptr <= #value + 4) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[head] == 1) && !(head == 0)) && ((((1 <= head + data && 2 * len <= 4) && head + data <= 1) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && head + data <= 1) && head + len <= 1))) && 0 == head) && #memory_$Pointer$[head][0 + 4] == head)) || \old(data) + #NULL < 1 - InvariantResult [Line: 607]: Loop Invariant [2018-11-10 13:22:21,487 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,487 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,487 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,488 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,489 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,490 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,491 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,492 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,493 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,493 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,493 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,493 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,493 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,494 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,494 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,494 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,494 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:22:21,494 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:22:21,494 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,495 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,496 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,497 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,498 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,498 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:22:21,499 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((!(#memory_$Pointer$[s][0 + 4] == s) && ((((((!(s == 0) && s + data <= 1) && i + #NULL <= 0) && #NULL <= i) && #NULL <= s) && 1 <= #NULL + data) || (((((((!(s == 0) && s + data <= 1) && #NULL + new_data <= 2) && i + data <= 2) && #NULL <= s) && 2 <= i + data) && 1 <= #NULL + data) && 4 <= new_data + len))) && #memory_$Pointer$[s][0 + 4] == s) && i + len <= 2) && 2 <= len) || ((((((!(#memory_$Pointer$[s][0 + 4] == s) && i + 1 <= unknown-#memory_int-unknown[s][s]) && ((((((!(s == 0) && s + data <= 1) && i + #NULL <= 0) && #NULL <= i) && #NULL <= s) && 1 <= #NULL + data) || (((((((!(s == 0) && s + data <= 1) && #NULL + new_data <= 2) && i + data <= 2) && #NULL <= s) && 2 <= i + data) && 1 <= #NULL + data) && 4 <= new_data + len))) && s == #memory_$Pointer$[s][0 + 4]) && unknown-#memory_int-unknown[s][s] <= i + 1) && 2 * len <= 4) && 2 <= len)) || !(#NULL == 0)) || !(#NULL == 0)) || (((((((((len + 1 == new_data && len == unknown-#memory_int-unknown[s][s]) && i + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]]) && 0 == s) && 2 <= i) && #memory_$Pointer$[s][0 + 4] == s) && 2 * len <= 4) && data <= #NULL + 1) && 1 <= #NULL + data) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= unknown-#memory_int-unknown[s][s] + 1) - InvariantResult [Line: 602]: Loop Invariant [2018-11-10 13:22:21,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,500 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-10 13:22:21,501 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((2 * #NULL < 0 || #NULL < #NULL) || 0 < 2 * #NULL) || #NULL < #NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 63 locations, 1 error locations. SAFE Result, 189.2s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 91.7s AutomataDifference, 0.0s DeadEndRemovalTime, 53.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 737 SDtfs, 1153 SDslu, 4242 SDs, 0 SdLazy, 5373 SolverSat, 772 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 30.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2106 GetRequests, 1688 SyntacticMatches, 48 SemanticMatches, 370 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6453 ImplicationChecksByTransitivity, 93.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9533350932507171 AbsIntWeakeningRatio, 1.8953488372093024 AbsIntAvgWeakeningVarsNumRemoved, 92.46511627906976 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 202 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 131 PreInvPairs, 194 NumberOfFragments, 1766 HoareAnnotationTreeSize, 131 FomulaSimplifications, 15388 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 71287 FormulaSimplificationTreeSizeReductionInter, 51.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 1901 NumberOfCodeBlocks, 1864 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2743 ConstructedInterpolants, 49 QuantifiedInterpolants, 875485 SizeOfPredicates, 105 NumberOfNonLiveVariables, 4778 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 1346/1629 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...