./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-5842f4b [2018-11-18 15:51:33,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:51:33,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:51:33,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:51:33,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:51:33,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:51:33,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:51:33,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:51:33,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:51:33,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:51:33,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:51:33,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:51:33,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:51:33,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:51:33,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:51:33,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:51:33,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:51:33,051 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:51:33,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:51:33,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:51:33,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:51:33,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:51:33,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:51:33,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:51:33,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:51:33,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:51:33,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:51:33,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:51:33,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:51:33,062 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:51:33,062 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:51:33,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:51:33,063 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:51:33,063 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:51:33,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:51:33,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:51:33,064 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:51:33,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:51:33,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:51:33,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:51:33,075 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:51:33,075 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:51:33,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:51:33,075 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:51:33,076 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:51:33,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:51:33,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:51:33,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:51:33,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:51:33,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:51:33,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:51:33,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:51:33,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:51:33,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:51:33,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:51:33,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:51:33,080 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_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:51:33,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:51:33,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:51:33,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:51:33,113 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:51:33,113 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:51:33,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:51:33,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/data/51f0613a3/e9a07790c8804b498210f4514f313a5f/FLAG2ff291be6 [2018-11-18 15:51:33,533 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:51:33,534 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:51:33,542 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/data/51f0613a3/e9a07790c8804b498210f4514f313a5f/FLAG2ff291be6 [2018-11-18 15:51:33,917 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/data/51f0613a3/e9a07790c8804b498210f4514f313a5f [2018-11-18 15:51:33,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:51:33,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:51:33,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:51:33,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:51:33,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:51:33,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:51:33" (1/1) ... [2018-11-18 15:51:33,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37764a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:33, skipping insertion in model container [2018-11-18 15:51:33,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:51:33" (1/1) ... [2018-11-18 15:51:33,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:51:33,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:51:34,149 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:51:34,156 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:51:34,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:51:34,258 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:51:34,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34 WrapperNode [2018-11-18 15:51:34,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:51:34,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:51:34,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:51:34,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:51:34,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:51:34,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:51:34,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:51:34,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:51:34,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... [2018-11-18 15:51:34,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:51:34,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:51:34,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:51:34,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:51:34,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:51:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-18 15:51:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-18 15:51:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-18 15:51:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-18 15:51:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:51:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:51:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-18 15:51:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-18 15:51:34,336 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:51:34,336 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-18 15:51:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-18 15:51:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:51:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:51:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:51:34,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:51:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:51:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:51:34,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:51:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:51:34,540 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:51:34,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:51:34 BoogieIcfgContainer [2018-11-18 15:51:34,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:51:34,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:51:34,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:51:34,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:51:34,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:51:33" (1/3) ... [2018-11-18 15:51:34,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bb7226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:51:34, skipping insertion in model container [2018-11-18 15:51:34,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:51:34" (2/3) ... [2018-11-18 15:51:34,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bb7226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:51:34, skipping insertion in model container [2018-11-18 15:51:34,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:51:34" (3/3) ... [2018-11-18 15:51:34,547 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-18 15:51:34,555 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:51:34,561 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:51:34,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:51:34,591 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:51:34,591 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:51:34,591 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:51:34,591 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:51:34,591 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:51:34,591 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:51:34,591 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:51:34,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:51:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-18 15:51:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 15:51:34,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:34,606 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-18 15:51:34,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:34,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1048679746, now seen corresponding path program 1 times [2018-11-18 15:51:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:34,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:34,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:34,706 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-18 15:51:34,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:51:34,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:51:34,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:51:34,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:51:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:51:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:51:34,721 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-18 15:51:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:51:34,738 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-18 15:51:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:51:34,739 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-18 15:51:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:51:34,744 INFO L225 Difference]: With dead ends: 101 [2018-11-18 15:51:34,744 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 15:51:34,747 INFO L604 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-18 15:51:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 15:51:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-18 15:51:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 15:51:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-18 15:51:34,772 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 26 [2018-11-18 15:51:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:51:34,772 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-18 15:51:34,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:51:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-18 15:51:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:51:34,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:34,773 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-18 15:51:34,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:34,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash 360214037, now seen corresponding path program 1 times [2018-11-18 15:51:34,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:34,845 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-18 15:51:34,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:51:34,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:51:34,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:51:34,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:51:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:51:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:51:34,847 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-11-18 15:51:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:51:34,907 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-18 15:51:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:51:34,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-18 15:51:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:51:34,909 INFO L225 Difference]: With dead ends: 81 [2018-11-18 15:51:34,910 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 15:51:34,910 INFO L604 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-18 15:51:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 15:51:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-18 15:51:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 15:51:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-18 15:51:34,920 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-11-18 15:51:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:51:34,921 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 15:51:34,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:51:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 15:51:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 15:51:34,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:34,922 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-18 15:51:34,922 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:34,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 175679476, now seen corresponding path program 1 times [2018-11-18 15:51:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:34,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:34,995 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-18 15:51:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:34,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:51:34,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 15:51:34,998 INFO L202 CegarAbsIntRunner]: [16], [18], [22], [25], [34], [38], [43], [45], [48], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [118], [119], [120], [126], [128], [129], [130], [131], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:51:35,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:51:35,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:51:35,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:51:35,193 INFO L272 AbstractInterpreter]: Visited 25 different actions 61 times. Merged at 8 different actions 18 times. Never widened. Performed 427 root evaluator evaluations with a maximum evaluation depth of 3. Performed 427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-11-18 15:51:35,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:35,201 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:51:35,264 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 80.81% of their original sizes. [2018-11-18 15:51:35,264 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:51:35,388 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-18 15:51:35,388 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:51:35,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:51:35,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-18 15:51:35,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:51:35,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 15:51:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:51:35,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:51:35,390 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 14 states. [2018-11-18 15:51:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:51:35,847 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-11-18 15:51:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:51:35,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-18 15:51:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:51:35,848 INFO L225 Difference]: With dead ends: 68 [2018-11-18 15:51:35,848 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 15:51:35,849 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-18 15:51:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 15:51:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-18 15:51:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 15:51:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-18 15:51:35,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2018-11-18 15:51:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:51:35,856 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 15:51:35,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 15:51:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-18 15:51:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:51:35,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:35,858 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-18 15:51:35,858 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:35,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -925187627, now seen corresponding path program 1 times [2018-11-18 15:51:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:35,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:35,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:35,942 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-18 15:51:35,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:35,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:51:35,942 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-18 15:51:35,943 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [118], [119], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:51:35,944 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:51:35,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:51:35,990 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:51:35,991 INFO L272 AbstractInterpreter]: Visited 34 different actions 66 times. Merged at 8 different actions 13 times. Never widened. Performed 458 root evaluator evaluations with a maximum evaluation depth of 4. Performed 458 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-11-18 15:51:35,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:35,998 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:51:36,040 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2018-11-18 15:51:36,040 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:51:36,290 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-11-18 15:51:36,291 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:51:36,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:51:36,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-18 15:51:36,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:51:36,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 15:51:36,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 15:51:36,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:51:36,293 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 22 states. [2018-11-18 15:51:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:51:37,457 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-11-18 15:51:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 15:51:37,457 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-18 15:51:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:51:37,459 INFO L225 Difference]: With dead ends: 85 [2018-11-18 15:51:37,459 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 15:51:37,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-11-18 15:51:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 15:51:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-11-18 15:51:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 15:51:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-18 15:51:37,467 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 49 [2018-11-18 15:51:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:51:37,467 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-18 15:51:37,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 15:51:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-18 15:51:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 15:51:37,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:37,469 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-18 15:51:37,470 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:37,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1190345584, now seen corresponding path program 1 times [2018-11-18 15:51:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:37,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:37,518 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-18 15:51:37,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:37,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:51:37,519 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-18 15:51:37,519 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [118], [119], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:51:37,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:51:37,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:51:37,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:51:37,611 INFO L272 AbstractInterpreter]: Visited 48 different actions 165 times. Merged at 25 different actions 61 times. Never widened. Performed 1072 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1072 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-18 15:51:37,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:37,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:51:37,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:37,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:51:37,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:37,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:51:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:37,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:51:37,699 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-18 15:51:37,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:51:37,794 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-18 15:51:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:51:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-18 15:51:37,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:51:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:51:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:51:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:51:37,812 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 6 states. [2018-11-18 15:51:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:51:37,860 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-11-18 15:51:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:51:37,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-18 15:51:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:51:37,861 INFO L225 Difference]: With dead ends: 122 [2018-11-18 15:51:37,861 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 15:51:37,862 INFO L604 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-18 15:51:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 15:51:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-18 15:51:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 15:51:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-18 15:51:37,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 61 [2018-11-18 15:51:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:51:37,871 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-18 15:51:37,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:51:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-18 15:51:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 15:51:37,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:51:37,873 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-18 15:51:37,873 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:51:37,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:51:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash -474203825, now seen corresponding path program 2 times [2018-11-18 15:51:37,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:51:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:37,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:51:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:51:37,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:51:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:51:38,647 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-18 15:51:38,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:38,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:51:38,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:51:38,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:51:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:51:38,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:51:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:51:38,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:51:38,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 15:51:38,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:51:38,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:51:38,713 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-18 15:51:38,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 15:51:38,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:51:38,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:51:38,766 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-18 15:51:38,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-18 15:51:38,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 15:51:38,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:51:38,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:51:38,780 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-18 15:51:38,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-18 15:51:40,869 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) 4) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-11-18 15:51:43,716 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 15:51:43,722 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-18 15:51:43,725 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-18 15:51:43,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:51:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:51:43,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:51:43,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-11-18 15:51:47,760 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 15:51:47,808 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-18 15:51:47,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:51:47,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:51:47,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2018-11-18 15:51:54,450 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-18 15:51:57,088 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 15:52:01,123 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 15:52:01,918 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) 4) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data 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_~head.offset sll_update_at_~data))) |c_#memory_int|))) is different from true [2018-11-18 15:52:01,927 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 40 treesize of output 40 [2018-11-18 15:52:01,930 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:52:01,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-18 15:52:01,931 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-18 15:52:01,944 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:52:01,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-18 15:52:01,945 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-18 15:52:01,957 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 26 treesize of output 24 [2018-11-18 15:52:01,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:01,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:52:01,984 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-18 15:52:01,986 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-18 15:52:01,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:01,990 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:01,993 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-18 15:52:01,995 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-18 15:52:01,995 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,005 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:52:02,058 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:56, output treesize:35 [2018-11-18 15:52:02,263 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-18 15:52:02,265 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 15 treesize of output 8 [2018-11-18 15:52:02,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 15:52:02,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:02,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2018-11-18 15:52:02,332 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-18 15:52:02,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:52:02,716 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:02,865 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:02,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:06,480 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 65 [2018-11-18 15:52:06,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:06,488 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:06,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:09,489 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 15:52:09,492 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:09,495 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:52:09,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-18 15:52:09,997 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-18 15:52:09,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,008 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-18 15:52:10,010 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-18 15:52:10,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,014 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-18 15:52:10,015 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-18 15:52:10,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,025 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-18 15:52:10,042 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-18 15:52:10,055 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-18 15:52:10,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,066 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-18 15:52:10,068 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-18 15:52:10,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,070 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,071 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-18 15:52:10,072 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-18 15:52:10,073 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,074 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,082 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-18 15:52:10,102 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-18 15:52:10,102 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:87, output treesize:43 [2018-11-18 15:52:10,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-11-18 15:52:10,257 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-18 15:52:10,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,265 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-18 15:52:10,267 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 17 treesize of output 11 [2018-11-18 15:52:10,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,274 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 9 [2018-11-18 15:52:10,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,283 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-18 15:52:10,283 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 15:52:10,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:52:10,290 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-18 15:52:10,306 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-18 15:52:10,319 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-18 15:52:10,320 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,327 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-18 15:52:10,329 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-18 15:52:10,329 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,336 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-18 15:52:10,336 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 15:52:10,343 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-18 15:52:10,344 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 15:52:10,347 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:52:10,352 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-18 15:52:10,362 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-18 15:52:10,362 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:111, output treesize:57 [2018-11-18 15:52:11,012 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-18 15:52:11,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:52:11,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 27] total 75 [2018-11-18 15:52:11,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:52:11,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-18 15:52:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-18 15:52:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5012, Unknown=12, NotChecked=286, Total=5550 [2018-11-18 15:52:11,029 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 51 states. [2018-11-18 15:52:27,443 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 15:52:29,488 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 15:52:33,686 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-11-18 15:52:35,751 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 15:52:37,798 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 15:52:44,083 WARN L180 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-18 15:52:46,731 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 15:52:51,129 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2018-11-18 15:52:53,577 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-18 15:52:54,137 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-11-18 15:52:56,764 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-18 15:52:59,249 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 15:53:00,676 WARN L180 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-18 15:53:03,117 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 15:53:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:03,512 INFO L93 Difference]: Finished difference Result 187 states and 234 transitions. [2018-11-18 15:53:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 15:53:03,512 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2018-11-18 15:53:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:03,514 INFO L225 Difference]: With dead ends: 187 [2018-11-18 15:53:03,514 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 15:53:03,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 95 SyntacticMatches, 12 SemanticMatches, 110 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 69.3s TimeCoverageRelationStatistics Valid=740, Invalid=11236, Unknown=22, NotChecked=434, Total=12432 [2018-11-18 15:53:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 15:53:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 129. [2018-11-18 15:53:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 15:53:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2018-11-18 15:53:03,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 71 [2018-11-18 15:53:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:03,536 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2018-11-18 15:53:03,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-18 15:53:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2018-11-18 15:53:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:53:03,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:03,539 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-18 15:53:03,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:03,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1950116437, now seen corresponding path program 1 times [2018-11-18 15:53:03,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:53:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:03,590 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-18 15:53:03,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:03,591 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-11-18 15:53:03,591 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [114], [118], [119], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:53:03,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:03,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:03,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:03,668 INFO L272 AbstractInterpreter]: Visited 49 different actions 139 times. Merged at 22 different actions 45 times. Never widened. Performed 848 root evaluator evaluations with a maximum evaluation depth of 4. Performed 848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 4 different actions. Largest state had 27 variables. [2018-11-18 15:53:03,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:03,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:03,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:03,756 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-18 15:53:03,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:03,803 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-18 15:53:03,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:53:03,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-11-18 15:53:03,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:03,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:53:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:53:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:53:03,830 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 5 states. [2018-11-18 15:53:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:03,865 INFO L93 Difference]: Finished difference Result 174 states and 214 transitions. [2018-11-18 15:53:03,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:53:03,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 15:53:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:03,867 INFO L225 Difference]: With dead ends: 174 [2018-11-18 15:53:03,867 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 15:53:03,871 INFO L604 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-18 15:53:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 15:53:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-11-18 15:53:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 15:53:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2018-11-18 15:53:03,897 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 73 [2018-11-18 15:53:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:03,897 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2018-11-18 15:53:03,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:53:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2018-11-18 15:53:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:53:03,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:03,899 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-18 15:53:03,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:03,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2027459575, now seen corresponding path program 3 times [2018-11-18 15:53:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:03,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:03,967 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-18 15:53:03,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:03,968 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:03,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:03,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:03,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:53:03,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 15:53:04,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:53:04,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:53:04,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:04,038 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-18 15:53:04,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:04,103 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-18 15:53:04,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:04,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-18 15:53:04,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:04,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:53:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:53:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:53:04,122 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand 8 states. [2018-11-18 15:53:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:04,201 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2018-11-18 15:53:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:53:04,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-11-18 15:53:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:04,203 INFO L225 Difference]: With dead ends: 244 [2018-11-18 15:53:04,203 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 15:53:04,204 INFO L604 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-18 15:53:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 15:53:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2018-11-18 15:53:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 15:53:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-11-18 15:53:04,219 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 73 [2018-11-18 15:53:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:04,219 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-11-18 15:53:04,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:53:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-11-18 15:53:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:53:04,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:04,221 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-18 15:53:04,221 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:04,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:04,221 INFO L82 PathProgramCache]: Analyzing trace with hash 681140169, now seen corresponding path program 4 times [2018-11-18 15:53:04,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:04,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:53:04,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,270 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-18 15:53:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:04,270 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:04,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:04,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:04,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:04,349 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-18 15:53:04,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:04,397 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-18 15:53:04,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:04,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-18 15:53:04,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:04,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:53:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:53:04,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:53:04,414 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-11-18 15:53:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:04,459 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2018-11-18 15:53:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:53:04,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-11-18 15:53:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:04,463 INFO L225 Difference]: With dead ends: 216 [2018-11-18 15:53:04,463 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 15:53:04,463 INFO L604 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-18 15:53:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 15:53:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-11-18 15:53:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 15:53:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2018-11-18 15:53:04,480 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 73 [2018-11-18 15:53:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:04,480 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2018-11-18 15:53:04,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:53:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2018-11-18 15:53:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:53:04,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:04,481 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-18 15:53:04,481 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:04,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1595368080, now seen corresponding path program 5 times [2018-11-18 15:53:04,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,539 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-18 15:53:04,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:04,540 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:04,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:04,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:04,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:53:04,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:53:04,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 15:53:04,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:53:04,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:04,600 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-18 15:53:04,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:04,657 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-18 15:53:04,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:53:04,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 10 [2018-11-18 15:53:04,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:04,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:53:04,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:53:04,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:53:04,672 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 7 states. [2018-11-18 15:53:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:04,735 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-11-18 15:53:04,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:53:04,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-11-18 15:53:04,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:04,737 INFO L225 Difference]: With dead ends: 175 [2018-11-18 15:53:04,738 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 15:53:04,738 INFO L604 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-18 15:53:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 15:53:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2018-11-18 15:53:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 15:53:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2018-11-18 15:53:04,754 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 81 [2018-11-18 15:53:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:04,754 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2018-11-18 15:53:04,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:53:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2018-11-18 15:53:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 15:53:04,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:04,755 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-18 15:53:04,756 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:04,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 640529923, now seen corresponding path program 1 times [2018-11-18 15:53:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:53:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:04,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,830 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-18 15:53:04,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:04,830 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2018-11-18 15:53:04,830 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [50], [52], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [118], [119], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:53:04,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:04,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:04,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:04,929 INFO L272 AbstractInterpreter]: Visited 50 different actions 187 times. Merged at 27 different actions 68 times. Never widened. Performed 1220 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 27 variables. [2018-11-18 15:53:04,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:04,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:04,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:04,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:04,991 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-18 15:53:04,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:05,026 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-18 15:53:05,042 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:53:05,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-11-18 15:53:05,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:05,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:53:05,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:53:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:53:05,042 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 6 states. [2018-11-18 15:53:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:05,092 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2018-11-18 15:53:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:53:05,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 15:53:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:05,094 INFO L225 Difference]: With dead ends: 168 [2018-11-18 15:53:05,094 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 15:53:05,095 INFO L604 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-18 15:53:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 15:53:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2018-11-18 15:53:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 15:53:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2018-11-18 15:53:05,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 83 [2018-11-18 15:53:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:05,104 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2018-11-18 15:53:05,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:53:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2018-11-18 15:53:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 15:53:05,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:05,105 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-18 15:53:05,106 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -532575735, now seen corresponding path program 1 times [2018-11-18 15:53:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:05,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:53:05,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:05,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:05,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-11-18 15:53:05,489 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [10], [14], [15], [16], [18], [22], [25], [27], [30], [34], [38], [43], [45], [48], [50], [52], [58], [65], [66], [82], [86], [89], [91], [93], [95], [99], [100], [104], [108], [112], [114], [118], [119], [120], [126], [128], [129], [130], [131], [132], [133], [134], [135], [138], [139], [140], [141], [142] [2018-11-18 15:53:05,490 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:05,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:05,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:05,571 INFO L272 AbstractInterpreter]: Visited 51 different actions 179 times. Merged at 30 different actions 70 times. Never widened. Performed 1070 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1070 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 8 different actions. Largest state had 27 variables. [2018-11-18 15:53:05,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:05,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:05,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:05,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:05,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:05,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:05,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:05,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-18 15:53:05,694 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 10 treesize of output 9 [2018-11-18 15:53:05,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,712 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 13 treesize of output 10 [2018-11-18 15:53:05,717 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 10 treesize of output 9 [2018-11-18 15:53:05,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,723 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-18 15:53:05,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:1 [2018-11-18 15:53:05,824 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 35 treesize of output 24 [2018-11-18 15:53:05,826 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 24 treesize of output 23 [2018-11-18 15:53:05,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,832 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-18 15:53:05,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:47 [2018-11-18 15:53:06,177 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 96 treesize of output 94 [2018-11-18 15:53:06,191 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2018-11-18 15:53:06,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 15:53:06,221 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 90 treesize of output 82 [2018-11-18 15:53:06,221 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-18 15:53:06,248 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 82 treesize of output 70 [2018-11-18 15:53:06,249 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-18 15:53:06,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:06,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 64 [2018-11-18 15:53:06,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-11-18 15:53:06,303 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-18 15:53:06,321 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2018-11-18 15:53:06,322 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 15:53:06,339 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 52 treesize of output 40 [2018-11-18 15:53:06,340 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,361 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:06,363 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 70 treesize of output 60 [2018-11-18 15:53:06,365 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 34 treesize of output 22 [2018-11-18 15:53:06,365 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-18 15:53:06,372 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 23 treesize of output 15 [2018-11-18 15:53:06,373 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-18 15:53:06,379 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,384 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 74 treesize of output 72 [2018-11-18 15:53:06,387 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 68 treesize of output 56 [2018-11-18 15:53:06,387 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,414 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 56 treesize of output 48 [2018-11-18 15:53:06,415 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 44 [2018-11-18 15:53:06,438 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,453 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-18 15:53:06,502 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 40 treesize of output 38 [2018-11-18 15:53:06,504 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 34 treesize of output 25 [2018-11-18 15:53:06,505 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,518 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 25 treesize of output 21 [2018-11-18 15:53:06,519 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:53:06,531 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 30 treesize of output 11 [2018-11-18 15:53:06,532 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,537 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-11-18 15:53:06,541 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:53:06,542 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 26 treesize of output 7 [2018-11-18 15:53:06,542 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,547 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,548 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 22 treesize of output 16 [2018-11-18 15:53:06,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 15:53:06,550 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,553 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-11-18 15:53:06,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:53:06,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2018-11-18 15:53:06,565 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,576 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,581 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 48 treesize of output 46 [2018-11-18 15:53:06,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-18 15:53:06,583 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,600 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 33 treesize of output 29 [2018-11-18 15:53:06,600 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:53:06,616 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 38 treesize of output 19 [2018-11-18 15:53:06,616 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,632 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,633 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 40 treesize of output 30 [2018-11-18 15:53:06,635 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:53:06,636 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 26 treesize of output 7 [2018-11-18 15:53:06,636 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,639 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,648 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 7 variables, input treesize:99, output treesize:10 [2018-11-18 15:53:06,680 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-18 15:53:06,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:07,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-11-18 15:53:07,051 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 13 treesize of output 3 [2018-11-18 15:53:07,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,055 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 27 treesize of output 17 [2018-11-18 15:53:07,056 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 13 treesize of output 3 [2018-11-18 15:53:07,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,058 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 35 treesize of output 25 [2018-11-18 15:53:07,060 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 13 treesize of output 3 [2018-11-18 15:53:07,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:07,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 15:53:07,081 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:63, output treesize:29 [2018-11-18 15:53:07,215 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-18 15:53:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:07,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 16] total 48 [2018-11-18 15:53:07,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:07,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 15:53:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 15:53:07,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2094, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 15:53:07,232 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 37 states. [2018-11-18 15:53:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:08,897 INFO L93 Difference]: Finished difference Result 207 states and 244 transitions. [2018-11-18 15:53:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-18 15:53:08,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 85 [2018-11-18 15:53:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:08,898 INFO L225 Difference]: With dead ends: 207 [2018-11-18 15:53:08,898 INFO L226 Difference]: Without dead ends: 205 [2018-11-18 15:53:08,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 145 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=686, Invalid=6120, Unknown=0, NotChecked=0, Total=6806 [2018-11-18 15:53:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-18 15:53:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 138. [2018-11-18 15:53:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 15:53:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2018-11-18 15:53:08,919 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 85 [2018-11-18 15:53:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:08,919 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2018-11-18 15:53:08,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 15:53:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2018-11-18 15:53:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 15:53:08,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:08,919 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-18 15:53:08,920 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:08,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1689285775, now seen corresponding path program 2 times [2018-11-18 15:53:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:08,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:08,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:08,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:08,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:08,981 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-18 15:53:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:08,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:08,982 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:08,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:08,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:08,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:53:08,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:53:09,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 15:53:09,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:53:09,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:09,048 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-18 15:53:09,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:09,107 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-18 15:53:09,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-18 15:53:09,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:09,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:53:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:53:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:53:09,124 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 8 states. [2018-11-18 15:53:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:09,215 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2018-11-18 15:53:09,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:53:09,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-11-18 15:53:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:09,217 INFO L225 Difference]: With dead ends: 194 [2018-11-18 15:53:09,217 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 15:53:09,218 INFO L604 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-18 15:53:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 15:53:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-18 15:53:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 15:53:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-11-18 15:53:09,232 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 87 [2018-11-18 15:53:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:09,232 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-18 15:53:09,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:53:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-11-18 15:53:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:53:09,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:09,233 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-18 15:53:09,233 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:09,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -369016117, now seen corresponding path program 6 times [2018-11-18 15:53:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:09,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:53:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:09,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:09,286 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-18 15:53:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:09,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:09,286 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:09,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:09,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/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-18 15:53:09,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:53:09,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 15:53:09,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:53:09,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:53:09,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:09,354 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-18 15:53:09,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:09,414 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-18 15:53:09,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:53:09,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2018-11-18 15:53:09,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:09,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:53:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:53:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:53:09,438 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 6 states. [2018-11-18 15:53:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:09,462 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-11-18 15:53:09,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:53:09,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-18 15:53:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:09,463 INFO L225 Difference]: With dead ends: 116 [2018-11-18 15:53:09,463 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:53:09,464 INFO L604 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-18 15:53:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:53:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:53:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:53:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:53:09,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-11-18 15:53:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:09,464 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:53:09,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:53:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:53:09,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:53:09,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:53:09,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:53:09,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:53:09,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:53:09,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:53:09,954 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-11-18 15:53:26,170 WARN L180 SmtUtils]: Spent 16.18 s on a formula simplification. DAG size of input: 147 DAG size of output: 55 [2018-11-18 15:53:30,179 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 56 DAG size of output: 1 [2018-11-18 15:53:30,487 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2018-11-18 15:53:38,566 WARN L180 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-11-18 15:53:52,684 WARN L180 SmtUtils]: Spent 14.06 s on a formula simplification. DAG size of input: 93 DAG size of output: 19 [2018-11-18 15:53:52,777 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-18 15:53:52,777 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-18 15:53:52,778 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-11-18 15:53:52,778 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse1 (= |#memory_int| |old(#memory_int)|))) (or (and (<= |sll_update_at_#in~data| sll_update_at_~data) (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) (+ |sll_update_at_#in~head.offset| 4)) sll_update_at_~head.base) (<= sll_update_at_~data |sll_update_at_#in~data|) .cse0 (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) (+ (- (- |sll_update_at_#in~head.offset|)) 4))) .cse1 (<= 1 |sll_update_at_#in~index|)) (and (<= sll_update_at_~index |sll_update_at_#in~index|) (<= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (<= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (<= sll_update_at_~head.offset |sll_update_at_#in~head.offset|) .cse1 (= sll_update_at_~data |sll_update_at_#in~data|)) (and .cse0 .cse1 (<= 2 |sll_update_at_#in~index|)) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) 4) v_main_~s~0.base_BEFORE_CALL_2)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0))))) [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L421 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) 4) v_main_~s~0.base_BEFORE_CALL_2)) (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)))) [2018-11-18 15:53:52,779 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse1 (= |sll_create_#in~len| 2)) (.cse0 (= |#NULL.base| 0)) (.cse2 (= |#NULL.offset| 0))) (let ((.cse3 (let ((.cse4 (= sll_create_~data 1))) (or (and .cse4 (not (= sll_create_~new_head~0.base 0)) (= sll_create_~new_head~0.offset 0) .cse1 .cse0 .cse2) (and .cse4 (= sll_create_~head~0.base 0) .cse1 .cse0 (= sll_create_~len 2) .cse2))))) (or (not .cse0) (not .cse1) (not .cse2) (and (= (select |#valid| sll_create_~head~0.base) 1) .cse3 (= 0 sll_create_~head~0.offset)) (not (= |sll_create_#in~data| 1)) (and .cse3 (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= sll_create_~head~0.offset 0))))) [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (let ((.cse0 (= sll_create_~data 1)) (.cse1 (not (= sll_create_~new_head~0.base 0))) (.cse2 (= sll_create_~new_head~0.offset 0)) (.cse3 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse4 (= 0 sll_create_~head~0.offset))) (or (not (= |#NULL.base| 0)) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.offset| 0)) (not (= |sll_create_#in~data| 1)) (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (or (and .cse0 (= sll_create_~head~0.base 0) (= sll_create_~len 2)) (and .cse0 .cse1 .cse2)) (= sll_create_~head~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (+ sll_create_~head~0.offset 4)) sll_create_~head~0.base)) .cse4) (and .cse0 .cse1 .cse2 (<= |sll_create_#in~len| (+ sll_create_~len 1)) .cse3 .cse4))) [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-18 15:53:52,779 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (= |#valid| |old(#valid)|) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.offset| 0)) (not (= |sll_create_#in~data| 1))) [2018-11-18 15:53:52,779 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= |#NULL.base| 0) (= |#NULL.offset| 0)) [2018-11-18 15:53:52,780 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L421 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse6 (= main_~i~0 0)) (.cse4 (= |#NULL.base| 0)) (.cse5 (= |#NULL.offset| 0))) (let ((.cse0 (let ((.cse7 (= main_~s~0.offset 0))) (or (and .cse4 .cse7 .cse5 (= main_~new_data~0 2) .cse6) (and (= main_~new_data~0 3) (= main_~i~0 1) .cse4 .cse7 .cse5)))) (.cse1 (= main_~data~0 1)) (.cse2 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base))) (.cse3 (= main_~len~0 2))) (or (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse0 .cse1 .cse2 .cse3) (not .cse4) (not .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6)))) [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point L611-3(lines 611 616) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L421 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse10 (+ main_~s~0.offset 4))) (let ((.cse9 (select .cse6 .cse10))) (let ((.cse1 (+ main_~len~0 1)) (.cse0 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse10)))) (let ((.cse2 (<= 0 main_~s~0.offset)) (.cse4 (= main_~data~0 1)) (.cse7 (<= main_~s~0.offset 0)) (.cse3 (<= .cse1 .cse0))) (or (not (= |#NULL.base| 0)) (let ((.cse5 (select (select |#memory_int| main_~s~0.base) 0))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 (<= (+ main_~i~0 2) .cse5) (not (= (select .cse6 4) main_~s~0.base)) (= main_~len~0 2) .cse7 (= main_~i~0 0) (<= .cse5 main_~len~0))) (not (= |#NULL.offset| 0)) (and (let ((.cse8 (+ .cse0 1))) (and (<= 1 main_~i~0) (<= (+ main_~i~0 main_~len~0) .cse8) (and (not (= .cse9 main_~s~0.base)) .cse2 .cse4 .cse7) (<= .cse8 (* 2 main_~len~0)) .cse3)) (<= main_~len~0 2))))))) [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 610) no Hoare annotation was computed. [2018-11-18 15:53:52,780 INFO L428 ceAbstractionStarter]: At program point L611-5(lines 611 616) the Hoare annotation is: true [2018-11-18 15:53:52,780 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (and (= |#valid| |old(#valid)|) (= main_~data~0 1) (= main_~len~0 2))) [2018-11-18 15:53:52,780 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L421 ceAbstractionStarter]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse10 (= main_~i~0 0)) (.cse4 (= |#NULL.base| 0)) (.cse5 (= |#NULL.offset| 0)) (.cse7 (= main_~data~0 1))) (let ((.cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse1 (let ((.cse11 (= main_~s~0.offset 0))) (or (and .cse4 .cse11 .cse5 .cse7 .cse10) (and (= main_~i~0 1) .cse4 .cse11 .cse5 (= main_~new_data~0 2) .cse7)))) (.cse2 (not (= (select .cse8 4) main_~s~0.base))) (.cse3 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (not .cse4) (not .cse5) (let ((.cse6 (+ (let ((.cse9 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse8 .cse9)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9))) 1))) (and (<= (+ main_~i~0 main_~len~0) .cse6) .cse0 (<= 0 main_~s~0.offset) .cse7 (<= 1 main_~i~0) .cse2 (<= .cse6 (* 2 main_~len~0)) .cse3 (<= main_~s~0.offset 0))) (and .cse1 .cse2 .cse3 .cse10)))) [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 610) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L421 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0))) [2018-11-18 15:53:52,781 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (= |#valid| |old(#valid)|)) [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-11-18 15:53:52,781 INFO L421 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse10 (+ main_~s~0.offset 4))) (let ((.cse9 (select .cse6 .cse10))) (let ((.cse1 (+ main_~len~0 1)) (.cse0 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse10)))) (let ((.cse3 (<= .cse1 .cse0)) (.cse2 (<= 0 main_~s~0.offset)) (.cse4 (= main_~data~0 1)) (.cse7 (<= main_~s~0.offset 0))) (or (not (= |#NULL.base| 0)) (not (= |#NULL.offset| 0)) (let ((.cse8 (select |#memory_int| main_~s~0.base))) (let ((.cse5 (select .cse8 0))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 (<= (+ main_~i~0 2) .cse5) (not (= (select .cse6 4) main_~s~0.base)) (= main_~len~0 2) .cse7 (= main_~i~0 0) (= main_~expected~0 (select .cse8 main_~s~0.offset)) (<= .cse5 main_~len~0)))) (and (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= (+ .cse0 1) (* 2 main_~len~0)) (and (<= main_~expected~0 .cse0) (<= .cse0 main_~expected~0)) .cse3 (and (not (= .cse9 main_~s~0.base)) .cse2 .cse4 .cse7)) (<= main_~len~0 2))))))) [2018-11-18 15:53:52,781 INFO L425 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point L613-2(lines 613 615) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 616) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L428 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point L589-1(lines 589 592) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L421 ceAbstractionStarter]: At program point L589-3(lines 589 592) the Hoare annotation is: (let ((.cse2 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_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.offset_BEFORE_CALL_7 Int) (v_main_~s~0.base_BEFORE_CALL_7 Int)) (let ((.cse0 (let ((.cse1 (+ v_main_~s~0.offset_BEFORE_CALL_7 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) .cse1)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) .cse1))))) (or (< .cse0 3) (< 3 .cse0)))) (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) (+ |sll_get_data_at_#in~head.offset| 4))) .cse2 (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) (+ (- (- |sll_get_data_at_#in~head.offset|)) 4))) (<= 1 |sll_get_data_at_#in~index|)) (and (<= 2 |sll_get_data_at_#in~index|) .cse2) (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= sll_get_data_at_~index |sll_get_data_at_#in~index|) (= 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-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point L589-4(lines 589 592) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-11-18 15:53:52,782 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))) (= |#valid| |old(#valid)|)) [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-18 15:53:52,782 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-18 15:53:52,783 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-18 15:53:52,785 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,790 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,793 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,794 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,794 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,798 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,801 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,802 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,802 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,802 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,802 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,808 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,809 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,809 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,809 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,809 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,809 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,810 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,811 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,811 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,811 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,813 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,815 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,816 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,816 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,816 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,817 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,818 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,819 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,819 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,819 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,820 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,820 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,820 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,820 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,820 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,820 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,821 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,822 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,822 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,822 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,822 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,822 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,823 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,824 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,825 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,825 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,826 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,826 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,827 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,827 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,828 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,828 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,828 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,828 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,832 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,832 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,833 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,833 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,834 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,835 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,837 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,837 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,837 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,837 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:53:52 BoogieIcfgContainer [2018-11-18 15:53:52,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:53:52,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:53:52,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:53:52,839 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:53:52,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:51:34" (3/4) ... [2018-11-18 15:53:52,843 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:53:52,848 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-18 15:53:52,848 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:53:52,848 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-18 15:53:52,848 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-11-18 15:53:52,848 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-18 15:53:52,849 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-11-18 15:53:52,849 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:53:52,849 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-18 15:53:52,853 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2018-11-18 15:53:52,853 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-18 15:53:52,853 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 15:53:52,875 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(#NULL == 0) || !(\old(len) == 2)) || !(#NULL == 0)) || !(\old(data) == 1)) || (((\valid == \old(\valid) && \old(len) <= len) && (((data == 1 && head == 0) && len == 2) || ((data == 1 && !(new_head == 0)) && new_head == 0))) && head == 0)) || (((((data == 1 && !(new_head == 0)) && new_head == 0) && \valid[head] == 1) && !(#memory_$Pointer$[head][head + 4] == head)) && 0 == head)) || (((((data == 1 && !(new_head == 0)) && new_head == 0) && \old(len) <= len + 1) && \valid[head] == 1) && 0 == head) [2018-11-18 15:53:52,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(data) <= data && #memory_$Pointer$[head][head + 4] == head) && data <= \old(data)) && index + 1 <= \old(index)) && head == #memory_$Pointer$[head][--head + 4]) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((index <= \old(index) && \old(index) <= index) && head == head) && head <= head) && head <= head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((index + 1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 2 <= \old(index))) || ((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][4] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0) [2018-11-18 15:53:52,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][4] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]] < 3 || 3 < unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]])) || (((head == #memory_$Pointer$[head][head + 4] && index + 1 <= \old(index)) && head == #memory_$Pointer$[head][--head + 4]) && 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index))) || (((head == head && index <= \old(index)) && head == head) && \old(index) <= index) [2018-11-18 15:53:52,896 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_adc60c94-2c11-4f15-9498-e4257463a9c2/bin-2019/utaipan/witness.graphml [2018-11-18 15:53:52,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:53:52,897 INFO L168 Benchmark]: Toolchain (without parser) took 138977.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 951.8 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 101.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:52,897 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:53:52,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:52,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:53:52,897 INFO L168 Benchmark]: Boogie Preprocessor took 21.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:52,898 INFO L168 Benchmark]: RCFGBuilder took 239.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:52,898 INFO L168 Benchmark]: TraceAbstraction took 138297.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.4 MB). Peak memory consumption was 451.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:52,898 INFO L168 Benchmark]: Witness Printer took 56.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:53:52,899 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 239.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 138297.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 156.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.4 MB). Peak memory consumption was 451.4 MB. Max. memory is 11.5 GB. * Witness Printer took 56.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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 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.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #NULL - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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 #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 #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 #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 #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 #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: 611]: Loop Invariant [2018-11-18 15:53:52,907 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,907 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,908 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,908 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,908 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,908 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,908 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,909 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,909 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,909 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,909 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,909 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,909 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,909 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,910 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,911 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,912 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,912 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,913 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,914 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,914 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,914 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,914 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,914 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,914 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,914 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,916 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,917 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,917 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,917 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(#NULL == 0) || (((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] <= len + 1 && 0 <= s) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && data == 1) && i + 2 <= unknown-#memory_int-unknown[s][0]) && !(#memory_$Pointer$[s][4] == s)) && len == 2) && s <= 0) && i == 0) && unknown-#memory_int-unknown[s][0] <= len)) || !(#NULL == 0)) || (((((1 <= i && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && ((!(#memory_$Pointer$[s][s + 4] == s) && 0 <= s) && data == 1) && s <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]]) && len <= 2) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 589]: Loop Invariant [2018-11-18 15:53:52,917 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,917 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,918 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,919 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,919 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,920 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,921 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,921 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,921 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,921 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,921 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,922 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,923 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-18 15:53:52,923 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,923 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,923 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,923 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,923 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,924 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][4] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0)) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int :: unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]] < 3 || 3 < unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4]])) || (((head == #memory_$Pointer$[head][head + 4] && index + 1 <= \old(index)) && head == #memory_$Pointer$[head][--head + 4]) && 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index))) || (((head == head && index <= \old(index)) && head == head) && \old(index) <= index) - InvariantResult [Line: 596]: Loop Invariant [2018-11-18 15:53:52,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,925 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,926 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,927 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,928 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((\old(data) <= data && #memory_$Pointer$[head][head + 4] == head) && data <= \old(data)) && index + 1 <= \old(index)) && head == #memory_$Pointer$[head][--head + 4]) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((index <= \old(index) && \old(index) <= index) && head == head) && head <= head) && head <= head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((index + 1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 2 <= \old(index))) || ((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][4] == v_main_~s~0.base_BEFORE_CALL_2) || !(#NULL == 0)) || !(#NULL == 0) - InvariantResult [Line: 574]: Loop Invariant [2018-11-18 15:53:52,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,930 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,930 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,930 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,930 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,931 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((!(#NULL == 0) || !(\old(len) == 2)) || !(#NULL == 0)) || !(\old(data) == 1)) || (((\valid == \old(\valid) && \old(len) <= len) && (((data == 1 && head == 0) && len == 2) || ((data == 1 && !(new_head == 0)) && new_head == 0))) && head == 0)) || (((((data == 1 && !(new_head == 0)) && new_head == 0) && \valid[head] == 1) && !(#memory_$Pointer$[head][head + 4] == head)) && 0 == head)) || (((((data == 1 && !(new_head == 0)) && new_head == 0) && \old(len) <= len + 1) && \valid[head] == 1) && 0 == head) - InvariantResult [Line: 607]: Loop Invariant [2018-11-18 15:53:52,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,932 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,932 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,935 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,935 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,935 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,935 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,935 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,936 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:52,936 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:52,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((len == unknown-#memory_int-unknown[s][s] && (((((#NULL == 0 && s == 0) && #NULL == 0) && data == 1) && i == 0) || (((((i == 1 && #NULL == 0) && s == 0) && #NULL == 0) && new_data == 2) && data == 1))) && !(#memory_$Pointer$[s][4] == s)) && len == 2) || !(#NULL == 0)) || !(#NULL == 0)) || ((((((((i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 && len == unknown-#memory_int-unknown[s][s]) && 0 <= s) && data == 1) && 1 <= i) && !(#memory_$Pointer$[s][4] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1 <= 2 * len) && len == 2) && s <= 0)) || ((((((((#NULL == 0 && s == 0) && #NULL == 0) && data == 1) && i == 0) || (((((i == 1 && #NULL == 0) && s == 0) && #NULL == 0) && new_data == 2) && data == 1)) && !(#memory_$Pointer$[s][4] == s)) && len == 2) && i == 0) - InvariantResult [Line: 602]: Loop Invariant [2018-11-18 15:53:52,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL [2018-11-18 15:53:52,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: !(#NULL == 0) || !(#NULL == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 63 locations, 1 error locations. SAFE Result, 138.1s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 56.3s AutomataDifference, 0.0s DeadEndRemovalTime, 43.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 666 SDtfs, 808 SDslu, 3860 SDs, 0 SdLazy, 3948 SolverSat, 459 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1863 GetRequests, 1502 SyntacticMatches, 52 SemanticMatches, 309 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4342 ImplicationChecksByTransitivity, 72.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.8926765095369745 AbsIntWeakeningRatio, 1.069767441860465 AbsIntAvgWeakeningVarsNumRemoved, 2.36046511627907 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 183 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 111 PreInvPairs, 162 NumberOfFragments, 1238 HoareAnnotationTreeSize, 111 FomulaSimplifications, 6136 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 12425 FormulaSimplificationTreeSizeReductionInter, 43.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 1703 NumberOfCodeBlocks, 1669 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2449 ConstructedInterpolants, 49 QuantifiedInterpolants, 858559 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2832 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 1138/1389 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...