./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d185ad037455b90cde67f589b43e0c5f37430bb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:11:50,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:11:50,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:11:50,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:11:50,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:11:50,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:11:50,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:11:50,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:11:50,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:11:50,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:11:50,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:11:50,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:11:50,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:11:50,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:11:50,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:11:50,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:11:50,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:11:50,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:11:50,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:11:50,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:11:50,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:11:50,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:11:50,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:11:50,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:11:50,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:11:50,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:11:50,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:11:50,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:11:50,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:11:50,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:11:50,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:11:50,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:11:50,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:11:50,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:11:50,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:11:50,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:11:50,119 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:11:50,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:11:50,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:11:50,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:11:50,131 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:11:50,131 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:11:50,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:11:50,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:11:50,132 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:11:50,132 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:11:50,132 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:11:50,133 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:11:50,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:11:50,134 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:11:50,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:11:50,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:11:50,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:11:50,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:11:50,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:11:50,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:11:50,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:11:50,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:11:50,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:11:50,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:11:50,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:11:50,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:11:50,138 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:11:50,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:11:50,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:11:50,139 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:11:50,139 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_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d185ad037455b90cde67f589b43e0c5f37430bb [2018-10-26 22:11:50,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:11:50,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:11:50,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:11:50,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:11:50,188 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:11:50,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 22:11:50,250 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/data/1aaa7f078/f02047972455455594cc04de5db8ef8b/FLAGccbd12380 [2018-10-26 22:11:50,635 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:11:50,638 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 22:11:50,649 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/data/1aaa7f078/f02047972455455594cc04de5db8ef8b/FLAGccbd12380 [2018-10-26 22:11:50,660 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/data/1aaa7f078/f02047972455455594cc04de5db8ef8b [2018-10-26 22:11:50,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:11:50,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:11:50,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:11:50,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:11:50,669 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:11:50,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:11:50" (1/1) ... [2018-10-26 22:11:50,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180fa223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:50, skipping insertion in model container [2018-10-26 22:11:50,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:11:50" (1/1) ... [2018-10-26 22:11:50,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:11:50,715 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:11:50,977 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:11:50,988 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:11:51,034 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:11:51,081 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:11:51,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51 WrapperNode [2018-10-26 22:11:51,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:11:51,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:11:51,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:11:51,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:11:51,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:11:51,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:11:51,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:11:51,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:11:51,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... [2018-10-26 22:11:51,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:11:51,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:11:51,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:11:51,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:11:51,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:11:51,283 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-10-26 22:11:51,284 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-10-26 22:11:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 22:11:51,284 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 22:11:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-10-26 22:11:51,284 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-10-26 22:11:51,284 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 22:11:51,285 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 22:11:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 22:11:51,285 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 22:11:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 22:11:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 22:11:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:11:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:11:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:11:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:11:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:11:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:11:51,908 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:11:51,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:11:51 BoogieIcfgContainer [2018-10-26 22:11:51,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:11:51,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:11:51,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:11:51,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:11:51,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:11:50" (1/3) ... [2018-10-26 22:11:51,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b85aa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:11:51, skipping insertion in model container [2018-10-26 22:11:51,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:11:51" (2/3) ... [2018-10-26 22:11:51,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b85aa99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:11:51, skipping insertion in model container [2018-10-26 22:11:51,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:11:51" (3/3) ... [2018-10-26 22:11:51,918 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-10-26 22:11:51,926 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:11:51,934 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:11:51,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:11:51,975 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:11:51,975 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:11:51,975 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:11:51,976 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:11:51,976 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:11:51,976 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:11:51,976 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:11:51,976 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:11:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-26 22:11:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 22:11:51,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:51,999 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-10-26 22:11:52,002 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:52,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1923088159, now seen corresponding path program 1 times [2018-10-26 22:11:52,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:11:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:11:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:11:52,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:52,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:11:52,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:11:52,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:11:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:11:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:11:52,150 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-10-26 22:11:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:52,175 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-10-26 22:11:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:11:52,176 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-10-26 22:11:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:52,186 INFO L225 Difference]: With dead ends: 101 [2018-10-26 22:11:52,186 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 22:11:52,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:11:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 22:11:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-26 22:11:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 22:11:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-10-26 22:11:52,225 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 26 [2018-10-26 22:11:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:52,225 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-10-26 22:11:52,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:11:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-10-26 22:11:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 22:11:52,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:52,226 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-10-26 22:11:52,228 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:52,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1742285523, now seen corresponding path program 1 times [2018-10-26 22:11:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:11:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:11:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:11:52,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:52,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:11:52,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:11:52,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:11:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:11:52,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:11:52,345 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-10-26 22:11:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:52,468 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-10-26 22:11:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:11:52,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-10-26 22:11:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:52,475 INFO L225 Difference]: With dead ends: 74 [2018-10-26 22:11:52,475 INFO L226 Difference]: Without dead ends: 59 [2018-10-26 22:11:52,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:11:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-26 22:11:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-10-26 22:11:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 22:11:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-10-26 22:11:52,493 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-10-26 22:11:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:52,494 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-10-26 22:11:52,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:11:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-10-26 22:11:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 22:11:52,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:52,496 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-10-26 22:11:52,496 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:52,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -954388374, now seen corresponding path program 1 times [2018-10-26 22:11:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:11:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:11:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:11:52,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:11:52,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 22:11:52,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:11:52,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:11:52,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:11:52,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:11:52,737 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-10-26 22:11:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:52,848 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-10-26 22:11:52,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:11:52,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-26 22:11:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:52,850 INFO L225 Difference]: With dead ends: 85 [2018-10-26 22:11:52,850 INFO L226 Difference]: Without dead ends: 54 [2018-10-26 22:11:52,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:11:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-26 22:11:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-26 22:11:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 22:11:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-26 22:11:52,857 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2018-10-26 22:11:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:52,857 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-26 22:11:52,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:11:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-10-26 22:11:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 22:11:52,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:52,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-10-26 22:11:52,858 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:52,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1486894025, now seen corresponding path program 1 times [2018-10-26 22:11:52,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:11:52,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:52,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:52,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:11:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 22:11:52,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:11:52,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:11:52,984 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-10-26 22:11:52,986 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-10-26 22:11:53,032 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:11:53,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:11:53,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:11:53,653 INFO L272 AbstractInterpreter]: Visited 30 different actions 66 times. Merged at 8 different actions 18 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-26 22:11:53,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:53,696 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:11:53,982 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 76.89% of their original sizes. [2018-10-26 22:11:53,982 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:11:55,668 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-10-26 22:11:55,668 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:11:55,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:11:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-10-26 22:11:55,669 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:11:55,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 22:11:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 22:11:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-10-26 22:11:55,670 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 20 states. [2018-10-26 22:11:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:11:58,876 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-10-26 22:11:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 22:11:58,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-10-26 22:11:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:11:58,877 INFO L225 Difference]: With dead ends: 88 [2018-10-26 22:11:58,877 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 22:11:58,884 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-26 22:11:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 22:11:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-10-26 22:11:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 22:11:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-10-26 22:11:58,894 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 49 [2018-10-26 22:11:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:11:58,895 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-10-26 22:11:58,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 22:11:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-10-26 22:11:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 22:11:58,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:11:58,896 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:11:58,896 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:11:58,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash -510098589, now seen corresponding path program 1 times [2018-10-26 22:11:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:11:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:11:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:11:58,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:11:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:11:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:11:59,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:11:59,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:11:59,092 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-26 22:11:59,092 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-10-26 22:11:59,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:11:59,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:11:59,554 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:11:59,554 INFO L272 AbstractInterpreter]: Visited 42 different actions 173 times. Merged at 21 different actions 69 times. Never widened. Found 13 fixpoints after 5 different actions. Largest state had 42 variables. [2018-10-26 22:11:59,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:11:59,593 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:11:59,779 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 75.76% of their original sizes. [2018-10-26 22:11:59,780 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:12:00,676 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-10-26 22:12:00,676 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:12:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:12:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-10-26 22:12:00,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:12:00,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:12:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:12:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:12:00,678 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 27 states. [2018-10-26 22:12:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:12:07,809 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-10-26 22:12:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 22:12:07,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-10-26 22:12:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:12:07,810 INFO L225 Difference]: With dead ends: 98 [2018-10-26 22:12:07,810 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 22:12:07,811 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2018-10-26 22:12:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 22:12:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2018-10-26 22:12:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-26 22:12:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-10-26 22:12:07,824 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 51 [2018-10-26 22:12:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:12:07,824 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-26 22:12:07,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:12:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-10-26 22:12:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 22:12:07,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:12:07,826 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:12:07,826 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:12:07,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:12:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1402777722, now seen corresponding path program 1 times [2018-10-26 22:12:07,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:12:07,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:12:07,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:12:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:12:07,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:12:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:12:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:12:08,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:12:08,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:12:08,088 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-10-26 22:12:08,089 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [69], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-10-26 22:12:08,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:12:08,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:12:08,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:12:08,441 INFO L272 AbstractInterpreter]: Visited 49 different actions 203 times. Merged at 27 different actions 83 times. Never widened. Found 16 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-26 22:12:08,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:12:08,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:12:08,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:12:08,443 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:12:08,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:12:08,452 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:12:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:12:08,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:12:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:12:08,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:12:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:12:09,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:12:09,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-10-26 22:12:09,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:12:09,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:12:09,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:12:09,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:12:09,140 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 6 states. [2018-10-26 22:12:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:12:09,282 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-10-26 22:12:09,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:12:09,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-10-26 22:12:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:12:09,285 INFO L225 Difference]: With dead ends: 136 [2018-10-26 22:12:09,285 INFO L226 Difference]: Without dead ends: 82 [2018-10-26 22:12:09,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:12:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-26 22:12:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-10-26 22:12:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 22:12:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-10-26 22:12:09,300 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 63 [2018-10-26 22:12:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:12:09,300 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-10-26 22:12:09,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:12:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-10-26 22:12:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 22:12:09,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:12:09,304 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-10-26 22:12:09,304 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:12:09,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:12:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1136256485, now seen corresponding path program 2 times [2018-10-26 22:12:09,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:12:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:12:09,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:12:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:12:09,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:12:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:12:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:12:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:12:10,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:12:10,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:12:10,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:12:10,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:12:10,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:12:10,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:12:10,344 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:12:10,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 22:12:10,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:12:10,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:12:10,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 22:12:10,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 22:12:10,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:12:10,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:12:10,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-26 22:12:10,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-26 22:12:10,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:12:10,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:12:10,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:12:10,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:12:10,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:10,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-10-26 22:12:12,937 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-10-26 22:12:14,976 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:12:17,025 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 22:12:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-10-26 22:12:17,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-10-26 22:12:17,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:17,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:17,050 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-10-26 22:12:17,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-10-26 22:12:19,096 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 22:12:19,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-10-26 22:12:19,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-10-26 22:12:19,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:19,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:19,176 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-10-26 22:12:19,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-10-26 22:12:25,215 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 22:12:29,253 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:12:29,258 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2))) (exists ((|sll_update_at_write~int_#ptr.offset| Int) (|sll_update_at_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) |sll_update_at_write~int_#ptr.offset| |sll_update_at_write~int_#value|)) |c_#memory_int|))) is different from true [2018-10-26 22:12:29,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:12:29,381 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-10-26 22:12:29,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-10-26 22:12:29,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:12:29,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:29,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:29,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:50 [2018-10-26 22:12:29,796 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-10-26 22:12:29,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:12:29,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-10-26 22:12:29,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,832 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:12:29,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-10-26 22:12:29,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,853 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:12:29,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-26 22:12:29,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 22:12:29,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-10-26 22:12:29,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 22:12:29,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:12:29,943 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,952 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-10-26 22:12:29,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-26 22:12:29,967 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:29,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-10-26 22:12:29,987 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:30,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-10-26 22:12:30,030 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:12:30,047 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 22:12:30,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-26 22:12:30,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-10-26 22:12:30,089 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,095 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-10-26 22:12:30,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-26 22:12:30,106 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-26 22:12:30,127 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-10-26 22:12:30,148 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,159 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 22:12:30,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:12:30,163 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,169 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:30,186 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:69, output treesize:7 [2018-10-26 22:12:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-10-26 22:12:30,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:12:31,031 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:32,733 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:32,743 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:35,805 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-10-26 22:12:35,811 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:35,819 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:35,827 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-26 22:12:40,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 53 [2018-10-26 22:12:40,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-26 22:12:40,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-10-26 22:12:40,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-10-26 22:12:40,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-10-26 22:12:40,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 22:12:40,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 22:12:40,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 53 [2018-10-26 22:12:40,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-26 22:12:40,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-10-26 22:12:40,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-10-26 22:12:40,771 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,774 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-10-26 22:12:40,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 22:12:40,781 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,789 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:12:40,802 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 22:12:40,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-26 22:12:40,847 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:167, output treesize:59 [2018-10-26 22:12:41,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-10-26 22:12:41,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 22:12:41,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-10-26 22:12:41,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-10-26 22:12:41,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 22:12:41,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-10-26 22:12:41,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 22:12:41,201 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:12:41,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:12:41,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-10-26 22:12:41,371 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-10-26 22:12:41,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-10-26 22:12:41,373 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-10-26 22:12:41,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-10-26 22:12:41,400 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 22:12:41,413 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 22:12:41,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-10-26 22:12:41,429 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 22:12:41,434 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:12:41,443 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:12:41,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-10-26 22:12:41,487 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:143, output treesize:195 [2018-10-26 22:12:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:12:42,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:12:42,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 29] total 75 [2018-10-26 22:12:42,901 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:12:42,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-26 22:12:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-26 22:12:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5014, Unknown=11, NotChecked=286, Total=5550 [2018-10-26 22:12:42,903 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 49 states. [2018-10-26 22:13:21,650 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:13:27,715 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-10-26 22:13:35,988 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-10-26 22:13:40,090 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-26 22:13:42,328 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-26 22:13:59,371 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-10-26 22:14:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:42,779 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2018-10-26 22:14:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-26 22:14:42,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 73 [2018-10-26 22:14:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:42,783 INFO L225 Difference]: With dead ends: 186 [2018-10-26 22:14:42,783 INFO L226 Difference]: Without dead ends: 184 [2018-10-26 22:14:42,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 11 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 84.7s TimeCoverageRelationStatistics Valid=651, Invalid=10249, Unknown=28, NotChecked=414, Total=11342 [2018-10-26 22:14:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-26 22:14:42,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2018-10-26 22:14:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-26 22:14:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-10-26 22:14:42,823 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 73 [2018-10-26 22:14:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:42,824 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-10-26 22:14:42,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-26 22:14:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-10-26 22:14:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 22:14:42,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:42,825 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:14:42,825 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:42,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1856537867, now seen corresponding path program 3 times [2018-10-26 22:14:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:14:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:42,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:14:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:42,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:14:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:14:43,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:43,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:14:43,047 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:14:43,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:14:43,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:43,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/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-10-26 22:14:43,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:14:43,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 22:14:43,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:14:43,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:43,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:14:43,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 22:14:43,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:14:43,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2018-10-26 22:14:43,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:14:43,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:14:43,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:14:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:14:43,231 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 7 states. [2018-10-26 22:14:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:43,528 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2018-10-26 22:14:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:14:43,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-10-26 22:14:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:43,531 INFO L225 Difference]: With dead ends: 154 [2018-10-26 22:14:43,531 INFO L226 Difference]: Without dead ends: 125 [2018-10-26 22:14:43,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:14:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-26 22:14:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-26 22:14:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-26 22:14:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-10-26 22:14:43,552 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 75 [2018-10-26 22:14:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:43,554 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-10-26 22:14:43,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:14:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-10-26 22:14:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 22:14:43,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:43,555 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:14:43,555 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:43,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1779274111, now seen corresponding path program 4 times [2018-10-26 22:14:43,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:14:43,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:43,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:14:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:43,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:14:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:14:43,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:43,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:14:43,712 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:14:43,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:14:43,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:43,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/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-10-26 22:14:43,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:14:43,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:14:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:43,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:14:43,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:14:43,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:14:43,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-10-26 22:14:43,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:14:43,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:14:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:14:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:14:43,926 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 7 states. [2018-10-26 22:14:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:44,004 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2018-10-26 22:14:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:14:44,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-10-26 22:14:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:44,006 INFO L225 Difference]: With dead ends: 178 [2018-10-26 22:14:44,006 INFO L226 Difference]: Without dead ends: 118 [2018-10-26 22:14:44,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:14:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-26 22:14:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-10-26 22:14:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-26 22:14:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-10-26 22:14:44,025 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 75 [2018-10-26 22:14:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:44,026 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-10-26 22:14:44,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:14:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-10-26 22:14:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 22:14:44,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:44,027 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:14:44,027 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:44,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 53331007, now seen corresponding path program 5 times [2018-10-26 22:14:44,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:14:44,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:44,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:14:44,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:44,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:14:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:14:44,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:44,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:14:44,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:14:44,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:14:44,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:44,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:14:44,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:14:44,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:14:44,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:14:44,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:44,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:14:44,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:14:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:14:44,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-10-26 22:14:44,309 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:14:44,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:14:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:14:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:14:44,309 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 7 states. [2018-10-26 22:14:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:44,384 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-10-26 22:14:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:14:44,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-10-26 22:14:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:44,385 INFO L225 Difference]: With dead ends: 129 [2018-10-26 22:14:44,385 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 22:14:44,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:14:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 22:14:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-26 22:14:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 22:14:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-10-26 22:14:44,405 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 75 [2018-10-26 22:14:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:44,405 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-10-26 22:14:44,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:14:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-10-26 22:14:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 22:14:44,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:44,407 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-10-26 22:14:44,407 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:44,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 500744283, now seen corresponding path program 1 times [2018-10-26 22:14:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:14:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:44,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:14:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:44,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:14:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:14:44,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:44,759 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:14:44,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-10-26 22:14:44,759 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [29], [31], [35], [36], [37], [41], [44], [46], [48], [50], [54], [55], [59], [63], [67], [69], [73], [74], [75], [77], [81], [84], [86], [89], [93], [97], [102], [104], [107], [109], [111], [117], [120], [126], [128], [129], [130], [131], [132], [133], [134], [136], [137], [138], [139], [140], [141] [2018-10-26 22:14:44,761 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:14:44,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:14:45,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:14:45,374 INFO L272 AbstractInterpreter]: Visited 51 different actions 293 times. Merged at 32 different actions 142 times. Widened at 2 different actions 2 times. Found 29 fixpoints after 8 different actions. Largest state had 42 variables. [2018-10-26 22:14:45,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:45,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:14:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:45,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/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-10-26 22:14:45,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:14:45,430 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:14:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:45,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:45,640 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-10-26 22:14:45,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:14:45,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:45,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:45,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:45,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-10-26 22:14:46,201 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-10-26 22:14:46,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-10-26 22:14:46,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-10-26 22:14:46,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:14:46,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-10-26 22:14:46,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:14:46,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:63, output treesize:24 [2018-10-26 22:14:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:14:46,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:46,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-10-26 22:14:46,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:14:46,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-10-26 22:14:46,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:14:46,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-10-26 22:14:46,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:14:46,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:46,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:47,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-10-26 22:14:47,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:14:47,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:47,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:47,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-10-26 22:14:47,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:14:47,229 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 22:14:47,352 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:14:47,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-10-26 22:14:47,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:121 [2018-10-26 22:14:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:14:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:14:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 15] total 37 [2018-10-26 22:14:47,969 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:14:47,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-26 22:14:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-26 22:14:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:14:47,970 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 28 states. [2018-10-26 22:14:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:48,838 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-10-26 22:14:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 22:14:48,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-10-26 22:14:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:48,839 INFO L225 Difference]: With dead ends: 100 [2018-10-26 22:14:48,839 INFO L226 Difference]: Without dead ends: 98 [2018-10-26 22:14:48,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2018-10-26 22:14:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-26 22:14:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-10-26 22:14:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-26 22:14:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-10-26 22:14:48,854 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 85 [2018-10-26 22:14:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:48,854 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-10-26 22:14:48,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-26 22:14:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-10-26 22:14:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 22:14:48,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:14:48,855 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-10-26 22:14:48,855 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:14:48,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:14:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1014667777, now seen corresponding path program 2 times [2018-10-26 22:14:48,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:14:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:48,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:14:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:14:48,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:14:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:14:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:14:48,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:48,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:14:48,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:14:48,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:14:48,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:14:48,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:14:49,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:14:49,004 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:14:49,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 22:14:49,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:14:49,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:14:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:14:49,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:14:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 22:14:49,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:14:49,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-10-26 22:14:49,242 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:14:49,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:14:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:14:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:14:49,243 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 7 states. [2018-10-26 22:14:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:14:49,289 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-10-26 22:14:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:14:49,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-10-26 22:14:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:14:49,293 INFO L225 Difference]: With dead ends: 106 [2018-10-26 22:14:49,293 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:14:49,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:14:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:14:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:14:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:14:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:14:49,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-10-26 22:14:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:14:49,294 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:14:49,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:14:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:14:49,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:14:49,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:14:50,401 WARN L179 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2018-10-26 22:14:50,690 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2018-10-26 22:14:51,576 WARN L179 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 110 [2018-10-26 22:14:51,731 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2018-10-26 22:14:51,982 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 66 [2018-10-26 22:14:52,171 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2018-10-26 22:14:52,474 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2018-10-26 22:14:52,596 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 45 [2018-10-26 22:14:52,781 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 63 [2018-10-26 22:14:53,038 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2018-10-26 22:14:53,040 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-10-26 22:14:53,040 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-10-26 22:14:53,040 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-10-26 22:14:53,040 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-10-26 22:14:53,041 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-10-26 22:14:53,041 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse6 (+ sll_update_at_~index sll_update_at_~head.offset))) (let ((.cse8 (<= .cse6 1)) (.cse3 (+ sll_update_at_~index 1)) (.cse11 (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~index|))) (let ((.cse0 (= |sll_update_at_#in~head.base| 0)) (.cse9 (< 1 .cse11)) (.cse1 (let ((.cse14 (<= (* 2 sll_update_at_~data) 6))) (or (and (not (= sll_update_at_~head.base 0)) (<= sll_update_at_~index (+ sll_update_at_~head.offset 1)) .cse8 .cse14 (<= sll_update_at_~head.offset sll_update_at_~index) (<= 0 .cse6) (<= 1 (+ sll_update_at_~head.offset sll_update_at_~data))) (let ((.cse15 (* 2 sll_update_at_~index))) (and (<= 0 .cse15) .cse14 (<= .cse3 sll_update_at_~data) (<= .cse15 0)))))) (.cse7 (= |sll_update_at_#in~head.base| sll_update_at_~head.base)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2)) .cse0 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 4) (let ((.cse2 (+ |sll_update_at_#in~head.offset| 4))) (and .cse1 (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse2) sll_update_at_~head.base) (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse2)) (<= .cse3 |sll_update_at_#in~index|) .cse4 .cse5)) (and (<= |sll_update_at_#in~data| sll_update_at_~data) (<= 1 .cse6) .cse7 (= sll_update_at_~index 1) .cse4 .cse8 (<= (+ sll_update_at_~index sll_update_at_~data) 4)) (< (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) .cse9) (or (and (and .cse1 .cse4) (<= 1 |sll_update_at_#in~index|)) (let ((.cse10 (* 2 |sll_update_at_#in~head.offset|)) (.cse13 (* 2 |sll_update_at_#in~data|))) (or (< 0 .cse10) (< .cse11 0) .cse0 (< .cse10 0) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse12 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse12 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| (select .cse12 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) (< 6 .cse13) .cse9 (< .cse13 2))) (and (<= sll_update_at_~index 0) .cse1 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse7 .cse4 .cse5)))))) [2018-10-26 22:14:53,041 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L421 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (let ((.cse1 (+ |sll_update_at_#in~head.offset| |sll_update_at_#in~index|))) (let ((.cse2 (= |sll_update_at_#in~head.base| 0)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse5 (< 1 .cse1))) (and (or (let ((.cse0 (* 2 |sll_update_at_#in~head.offset|)) (.cse4 (* 2 |sll_update_at_#in~data|))) (or (< 0 .cse0) (< .cse1 0) .cse2 (< .cse0 0) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse3 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| (select .cse3 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) (< 6 .cse4) .cse5 (< .cse4 2))) .cse6) (or (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_2)) .cse2 .cse6 (< (+ |sll_update_at_#in~head.offset| 1) |sll_update_at_#in~index|) (< (+ |sll_update_at_#in~index| |sll_update_at_#in~data|) 4) (< (+ |sll_update_at_#in~index| 2) |sll_update_at_#in~data|) .cse5)))) [2018-10-26 22:14:53,042 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse1 (* 2 |sll_create_#in~len|)) (.cse2 (+ |sll_create_#in~data| |sll_create_#in~len|))) (let ((.cse0 (and (<= .cse1 4) (<= 3 .cse2) (and (<= sll_create_~data (+ sll_create_~head~0.offset 1)) (<= 1 (+ sll_create_~head~0.offset sll_create_~data)) (<= (* 2 sll_create_~head~0.offset) 0) (<= (* 2 sll_create_~len) 4) (<= 2 (+ sll_create_~data sll_create_~len))) (= |sll_create_#in~data| 1)))) (or (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) .cse0) (< 4 .cse1) (< 2 (* 2 |sll_create_#in~data|)) (< .cse2 3) (and (= (select |#valid| sll_create_~head~0.base) 1) .cse0)))) [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (let ((.cse7 (+ sll_create_~head~0.offset sll_create_~data))) (let ((.cse6 (+ sll_create_~head~0.offset 1)) (.cse5 (<= 1 .cse7)) (.cse4 (<= (* 2 sll_create_~head~0.offset) 0))) (let ((.cse0 (and (<= sll_create_~data .cse6) .cse5 .cse4 (<= (* 2 sll_create_~len) 4) (<= 2 (+ sll_create_~data sll_create_~len))))) (let ((.cse1 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse2 (not (= sll_create_~head~0.base 0))) (.cse3 (or .cse0 (and (<= 0 (+ sll_create_~head~0.offset sll_create_~len)) .cse5 (<= sll_create_~len .cse6) (<= .cse7 1))))) (or (< 4 (* 2 |sll_create_#in~len|)) (< 2 (* 2 |sll_create_#in~data|)) (and (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) .cse0) (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (+ 0 4)) sll_create_~head~0.base)) .cse1 .cse2 .cse3 (= 0 sll_create_~head~0.offset)) (< (+ |sll_create_#in~data| |sll_create_#in~len|) 3) (and (<= |sll_create_#in~len| (+ sll_create_~len 1)) .cse1 .cse2 .cse3 .cse4)))))) [2018-10-26 22:14:53,042 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-10-26 22:14:53,042 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |sll_create_#in~data| 1)) (< 3 (+ |sll_create_#in~data| |sll_create_#in~len|)) (< (* 2 |sll_create_#in~len|) 4)) [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 22:14:53,043 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L428 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point L589-1(lines 589 592) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L421 ceAbstractionStarter]: At program point L589-3(lines 589 592) the Hoare annotation is: (let ((.cse4 (forall ((v_main_~s~0.offset_BEFORE_CALL_7 Int) (v_main_~s~0.base_BEFORE_CALL_7 Int) (v_main_~len~0_BEFORE_CALL_21 Int)) (let ((.cse7 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7))) (or (< 2 v_main_~len~0_BEFORE_CALL_21) (< (* 2 v_main_~len~0_BEFORE_CALL_21) (+ .cse7 2)) (< .cse7 v_main_~len~0_BEFORE_CALL_21))))) (.cse0 (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)) (.cse1 (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) (and (or (and (<= (+ sll_get_data_at_~head.offset 1) sll_get_data_at_~index) .cse0 .cse1) (< (* 2 |sll_get_data_at_#in~head.offset|) 0) (let ((.cse2 (+ |sll_get_data_at_#in~head.offset| 4))) (and (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse2)) (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse2)))) (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3))) (or (= (select .cse3 (+ 0 4)) v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |#memory_int| (select .cse3 4)) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) 4)) 3))))) .cse4 (= |sll_get_data_at_#in~head.base| 0) (not (= |sll_get_data_at_#in~index| 1)) (< 1 (+ |sll_get_data_at_#in~index| |sll_get_data_at_#in~head.offset|))) (let ((.cse5 (<= sll_get_data_at_~index 0)) (.cse6 (<= 1 |sll_get_data_at_#in~index|))) (or (<= 2 |sll_get_data_at_#in~index|) (and .cse5 .cse6) .cse4 (and .cse0 .cse1 (< sll_get_data_at_~index 2) (or .cse5 .cse6)))))) [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point L589-4(lines 589 592) no Hoare annotation was computed. [2018-10-26 22:14:53,043 INFO L425 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-10-26 22:14:53,044 INFO L421 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse0 (not (= main_~s~0.base 0))) (.cse4 (not (= main_~s~0.base (select .cse2 (+ 0 4))))) (.cse5 (<= (+ main_~len~0 main_~data~0) 3)) (.cse6 (<= main_~len~0 (+ main_~data~0 1))) (.cse7 (<= 2 (+ main_~s~0.offset main_~len~0)))) (or (let ((.cse1 (* 2 main_~len~0))) (and .cse0 (= .cse1 (+ (let ((.cse3 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse2 .cse3)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse3))) 1)) .cse4 (<= (+ main_~new_data~0 2) (+ main_~i~0 .cse1)) (<= main_~len~0 main_~new_data~0) .cse5 .cse6 (<= (* 2 main_~s~0.offset) 0) (<= main_~i~0 0) .cse7)) (and .cse0 .cse4 .cse5 (<= (+ main_~len~0 1) main_~new_data~0) .cse6 (= main_~i~0 1) (<= (+ main_~s~0.offset main_~new_data~0) 3) .cse7 (<= 3 (+ main_~i~0 main_~len~0)))))) [2018-10-26 22:14:53,044 INFO L425 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-10-26 22:14:53,044 INFO L425 ceAbstractionStarter]: For program point L611-3(lines 611 616) no Hoare annotation was computed. [2018-10-26 22:14:53,044 INFO L421 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (let ((.cse3 (+ main_~new_data~0 2)) (.cse6 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse10 (not (= main_~s~0.base 0))) (.cse0 (<= main_~len~0 main_~new_data~0)) (.cse11 (<= (* 2 main_~s~0.offset) 0)) (.cse2 (<= main_~len~0 .cse5)) (.cse12 (= main_~data~0 1)) (.cse13 (+ main_~i~0 main_~len~0)) (.cse9 (<= .cse3 .cse6))) (or (and (let ((.cse1 (and .cse10 .cse11 .cse12 (<= 1 .cse13) (<= 2 (+ main_~s~0.offset main_~len~0))))) (or (let ((.cse4 (+ main_~i~0 .cse6))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) (<= (+ .cse5 2) .cse4))) (and .cse0 .cse1 (exists ((main_~len~0 Int)) (let ((.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse8 (* 2 main_~len~0))) (and (<= main_~len~0 main_~expected~0) (<= main_~len~0 .cse7) (<= (+ .cse7 2) .cse8) (<= main_~len~0 2) (<= (+ main_~expected~0 2) .cse8)))) .cse9))) (<= main_~len~0 2) (<= main_~i~0 0)) (let ((.cse14 (select |#memory_$Pointer$.base| main_~s~0.base))) (and .cse10 (= .cse6 (+ (let ((.cse15 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse14 .cse15)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse15))) 1)) .cse0 (not (= main_~s~0.base (select .cse14 (+ 0 4)))) .cse11 .cse2 .cse12 (<= (+ main_~i~0 1) main_~len~0) (<= main_~len~0 (+ main_~s~0.offset 2)) (<= (+ .cse5 1) .cse13) .cse9))))) [2018-10-26 22:14:53,044 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 610) no Hoare annotation was computed. [2018-10-26 22:14:53,044 INFO L428 ceAbstractionStarter]: At program point L611-5(lines 611 616) the Hoare annotation is: true [2018-10-26 22:14:53,044 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (let ((.cse0 (+ main_~data~0 1))) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= .cse0 main_~len~0) (<= main_~len~0 .cse0) (= main_~len~0 2))) [2018-10-26 22:14:53,044 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-10-26 22:14:53,044 INFO L421 ceAbstractionStarter]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse3 (* 2 main_~len~0)) (.cse10 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse1 (= .cse3 (+ (let ((.cse11 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse10 .cse11)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse11))) 1))) (.cse0 (not (= main_~s~0.base 0))) (.cse4 (not (= main_~s~0.base (select .cse10 (+ 0 4))))) (.cse5 (<= (* 2 main_~s~0.offset) 0)) (.cse6 (= main_~data~0 1)) (.cse8 (<= (+ main_~i~0 1) main_~len~0)) (.cse9 (<= main_~len~0 (+ main_~s~0.offset 2))) (.cse7 (+ main_~i~0 main_~len~0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 main_~new_data~0) (<= (+ .cse2 2) .cse3) .cse4 .cse5 (<= main_~len~0 .cse2) .cse6 (<= 1 .cse7) .cse8 .cse9 (<= (+ main_~new_data~0 2) .cse3))) (and .cse0 .cse1 .cse4 (= (+ main_~new_data~0 1) .cse3) (<= (+ main_~len~0 main_~data~0) 3) (<= main_~len~0 (+ main_~data~0 1)) (<= (+ main_~s~0.offset main_~new_data~0) 3) (<= main_~i~0 0) (<= main_~len~0 (+ main_~i~0 2)) (<= 4 .cse3) (<= 2 (+ main_~s~0.offset main_~len~0))) (and .cse0 .cse4 .cse5 .cse6 .cse8 .cse9 (<= 3 .cse7))))) [2018-10-26 22:14:53,044 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 610) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L421 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-10-26 22:14:53,045 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L421 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse0 (not (= main_~s~0.base 0))) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (* 2 main_~s~0.offset) 0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse7 (<= 2 (+ main_~s~0.offset main_~len~0))) (.cse8 (+ main_~new_data~0 2)) (.cse5 (* 2 main_~len~0))) (or (and .cse0 (exists ((main_~len~0 Int)) (let ((.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse2 (* 2 main_~len~0))) (and (<= main_~len~0 main_~expected~0) (<= main_~len~0 .cse1) (<= (+ .cse1 2) .cse2) (<= main_~len~0 2) (<= (+ main_~expected~0 2) .cse2)))) .cse3 .cse4 (= main_~data~0 1) (<= main_~i~0 0) (<= .cse5 (+ .cse6 2)) .cse7 (<= .cse8 (+ main_~i~0 .cse5))) (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (and .cse0 (not (= main_~s~0.base (select .cse9 (+ 0 4)))) (<= main_~len~0 .cse6) (= 3 (let ((.cse10 (+ main_~s~0.offset 4))) (select (select |#memory_int| (select .cse9 .cse10)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse10)))) .cse3 (<= (+ main_~len~0 main_~data~0) 3) (<= main_~len~0 (+ main_~data~0 1)) .cse4 (<= (+ main_~i~0 main_~expected~0) 4) (<= (+ .cse6 1) (+ main_~i~0 main_~len~0)) .cse7 (<= (+ main_~i~0 2) main_~expected~0) (<= .cse8 .cse5))))) [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point L613-2(lines 613 615) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 616) no Hoare annotation was computed. [2018-10-26 22:14:53,045 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |node_create_#in~data| 1))) [2018-10-26 22:14:53,045 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-10-26 22:14:53,046 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-10-26 22:14:53,046 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-10-26 22:14:53,046 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-10-26 22:14:53,046 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-10-26 22:14:53,050 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,051 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,051 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,052 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,052 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,052 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,052 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,058 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,059 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,059 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,059 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,060 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,060 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,072 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,072 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,073 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,075 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,076 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,076 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,076 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,076 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,076 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,077 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,078 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,080 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,080 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,080 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,080 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,087 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,087 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,088 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,088 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,088 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,088 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,089 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,089 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,089 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,089 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,095 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,095 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,095 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,095 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,095 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,096 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,097 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,097 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,097 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,098 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,098 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,098 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,099 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,099 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,101 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,101 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,101 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,110 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,110 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,111 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,111 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,113 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,114 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,116 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,116 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,129 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,130 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,130 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,130 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,130 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,131 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,131 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,131 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,132 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,132 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,132 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,133 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,133 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,133 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,133 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,134 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,134 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,134 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,134 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,134 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,135 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,136 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,136 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,147 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:14:53 BoogieIcfgContainer [2018-10-26 22:14:53,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:14:53,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:14:53,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:14:53,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:14:53,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:11:51" (3/4) ... [2018-10-26 22:14:53,169 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-10-26 22:14:53,174 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 22:14:53,175 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-10-26 22:14:53,179 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2018-10-26 22:14:53,179 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-10-26 22:14:53,179 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 22:14:53,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4 < 2 * \old(len) || 2 < 2 * \old(data)) || (((\valid == \old(\valid) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && (((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len)) || ((((!(#memory_$Pointer$[head][0 + 4] == head) && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 0 == head)) || \old(data) + \old(len) < 3) || ((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 2 * head <= 0) [2018-10-26 22:14:53,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && len <= unknown-#memory_int-unknown[s][s]) && new_data + 2 <= i + 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= i + 2 * len) || (((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && (\exists main_~len~0 : int :: (((main_~len~0 <= expected && main_~len~0 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * main_~len~0) && main_~len~0 <= 2) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len)) && len <= 2) && i <= 0) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && i + 1 <= len) && len <= s + 2) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && new_data + 2 <= 2 * len) [2018-10-26 22:14:53,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0 + 4] == v_main_~s~0.base_BEFORE_CALL_2) || head == 0) || head + 1 < \old(index)) || \old(index) + \old(data) < 4) || ((((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && #memory_$Pointer$[head][head + 4] == head) && head == #memory_$Pointer$[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((((((\old(data) <= data && 1 <= index + head) && head == head) && index == 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + head <= 1) && index + data <= 4)) || \old(index) + 2 < \old(data)) || 1 < head + \old(index)) && (((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((0 < 2 * head || head + \old(index) < 0) || head == 0) || 2 * head < 0) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || 6 < 2 * \old(data)) || 1 < head + \old(index)) || 2 * \old(data) < 2) || (((((index <= 0 && (((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0))) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) [2018-10-26 22:14:53,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((head + 1 <= index && head == head) && head == head) || 2 * head < 0) || (head == #memory_$Pointer$[head][head + 4] && head == #memory_$Pointer$[head][head + 4])) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || head == 0) || !(\old(index) == 1)) || 1 < \old(index) + head) && (((2 <= \old(index) || (index <= 0 && 1 <= \old(index))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) [2018-10-26 22:14:53,221 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d19f436d-a242-4d1e-b102-d772245ee086/bin-2019/utaipan/witness.graphml [2018-10-26 22:14:53,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:14:53,222 INFO L168 Benchmark]: Toolchain (without parser) took 182558.54 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 606.6 MB). Free memory was 955.9 MB in the beginning and 888.7 MB in the end (delta: 67.2 MB). Peak memory consumption was 673.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,222 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:14:53,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.25 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 929.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 929.0 MB in the beginning and 1.2 GB in the end (delta: -240.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,223 INFO L168 Benchmark]: Boogie Preprocessor took 43.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,223 INFO L168 Benchmark]: RCFGBuilder took 681.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,223 INFO L168 Benchmark]: TraceAbstraction took 181240.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 431.5 MB). Free memory was 1.1 GB in the beginning and 888.7 MB in the end (delta: 242.4 MB). Peak memory consumption was 721.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:14:53,223 INFO L168 Benchmark]: Witness Printer took 70.90 ms. Allocated memory is still 1.6 GB. Free memory is still 888.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:14:53,229 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.25 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 929.0 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 929.0 MB in the beginning and 1.2 GB in the end (delta: -240.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 181240.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 431.5 MB). Free memory was 1.1 GB in the beginning and 888.7 MB in the end (delta: 242.4 MB). Peak memory consumption was 721.2 MB. Max. memory is 11.5 GB. * Witness Printer took 70.90 ms. Allocated memory is still 1.6 GB. Free memory is still 888.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant [2018-10-26 22:14:53,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,236 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,249 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,249 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,251 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,251 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,253 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,254 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && len <= unknown-#memory_int-unknown[s][s]) && new_data + 2 <= i + 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= i + 2 * len) || (((len <= new_data && (((!(s == 0) && 2 * s <= 0) && data == 1) && 1 <= i + len) && 2 <= s + len) && (\exists main_~len~0 : int :: (((main_~len~0 <= expected && main_~len~0 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * main_~len~0) && main_~len~0 <= 2) && expected + 2 <= 2 * main_~len~0)) && new_data + 2 <= 2 * len)) && len <= 2) && i <= 0) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && i + 1 <= len) && len <= s + 2) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && new_data + 2 <= 2 * len) - InvariantResult [Line: 589]: Loop Invariant [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,255 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,256 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,257 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,259 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,261 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-10-26 22:14:53,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((head + 1 <= index && head == head) && head == head) || 2 * head < 0) || (head == #memory_$Pointer$[head][head + 4] && head == #memory_$Pointer$[head][head + 4])) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || head == 0) || !(\old(index) == 1)) || 1 < \old(index) + head) && (((2 <= \old(index) || (index <= 0 && 1 <= \old(index))) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (2 < v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] + 2) || unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) - InvariantResult [Line: 596]: Loop Invariant [2018-10-26 22:14:53,264 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,264 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,264 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,265 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,266 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,266 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,267 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,268 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,268 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,269 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,270 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,271 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,272 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((forall v_main_~s~0.base_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][0 + 4] == v_main_~s~0.base_BEFORE_CALL_2) || head == 0) || head + 1 < \old(index)) || \old(index) + \old(data) < 4) || ((((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && #memory_$Pointer$[head][head + 4] == head) && head == #memory_$Pointer$[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) || ((((((\old(data) <= data && 1 <= index + head) && head == head) && index == 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + head <= 1) && index + data <= 4)) || \old(index) + 2 < \old(data)) || 1 < head + \old(index)) && (((((((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) || ((((((0 < 2 * head || head + \old(index) < 0) || head == 0) || 2 * head < 0) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0 + 4] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][4]] == 3))) || 6 < 2 * \old(data)) || 1 < head + \old(index)) || 2 * \old(data) < 2) || (((((index <= 0 && (((((((!(head == 0) && index <= head + 1) && index + head <= 1) && 2 * data <= 6) && head <= index) && 0 <= index + head) && 1 <= head + data) || (((0 <= 2 * index && 2 * data <= 6) && index + 1 <= data) && 2 * index <= 0))) && head == head) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && data == \old(data))) - InvariantResult [Line: 574]: Loop Invariant [2018-10-26 22:14:53,273 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,273 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,273 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,274 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((4 < 2 * \old(len) || 2 < 2 * \old(data)) || (((\valid == \old(\valid) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && (((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len)) || ((((!(#memory_$Pointer$[head][0 + 4] == head) && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 0 == head)) || \old(data) + \old(len) < 3) || ((((\old(len) <= len + 1 && \valid[head] == 1) && !(head == 0)) && (((((data <= head + 1 && 1 <= head + data) && 2 * head <= 0) && 2 * len <= 4) && 2 <= data + len) || (((0 <= head + len && 1 <= head + data) && len <= head + 1) && head + data <= 1))) && 2 * head <= 0) - InvariantResult [Line: 607]: Loop Invariant [2018-10-26 22:14:53,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,278 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,280 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:14:53,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:14:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,281 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:14:53,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:14:53,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && len <= new_data) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && len <= unknown-#memory_int-unknown[s][s]) && data == 1) && 1 <= i + len) && i + 1 <= len) && len <= s + 2) && new_data + 2 <= 2 * len) || ((((((((((!(s == 0) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && !(s == #memory_$Pointer$[s][0 + 4])) && new_data + 1 == 2 * len) && len + data <= 3) && len <= data + 1) && s + new_data <= 3) && i <= 0) && len <= i + 2) && 4 <= 2 * len) && 2 <= s + len)) || ((((((!(s == 0) && !(s == #memory_$Pointer$[s][0 + 4])) && 2 * s <= 0) && data == 1) && i + 1 <= len) && len <= s + 2) && 3 <= i + len) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 63 locations, 1 error locations. SAFE Result, 181.0s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 132.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 620 SDslu, 3414 SDs, 0 SdLazy, 3007 SolverSat, 316 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 68.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1340 GetRequests, 1028 SyntacticMatches, 38 SemanticMatches, 274 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 92.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9512617043581153 AbsIntWeakeningRatio, 1.9183673469387754 AbsIntAvgWeakeningVarsNumRemoved, 95.6734693877551 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 71 PreInvPairs, 99 NumberOfFragments, 1724 HoareAnnotationTreeSize, 71 FomulaSimplifications, 4396 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14309 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 38.6s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1767 ConstructedInterpolants, 62 QuantifiedInterpolants, 782713 SizeOfPredicates, 91 NumberOfNonLiveVariables, 2927 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 664/834 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...