./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_add-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/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 c69389479aaa51869578ea93cca3b02df528e19e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:46,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:46,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:46,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:46,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:46,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:46,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:46,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:46,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:46,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:46,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:46,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:46,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:46,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:46,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:46,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:46,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:46,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:46,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:46,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:46,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:46,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:46,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:46,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:46,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:46,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:46,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:46,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:46,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:46,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:46,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:46,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:46,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:46,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:46,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:46,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:46,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:46,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:46,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:46,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:46,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:46,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:46,289 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:46,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:46,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:46,290 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:46,290 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:46,290 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:46,290 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:46,291 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:46,291 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:46,291 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:46,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:46,291 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:46,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:46,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:46,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:46,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:46,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:46,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:46,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:46,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:46,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:46,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:46,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:46,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:46,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:46,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:46,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:46,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:46,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:46,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:46,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:46,296 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:46,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:46,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:46,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:46,296 INFO L138 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_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/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 -> c69389479aaa51869578ea93cca3b02df528e19e [2019-10-22 11:23:46,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:46,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:46,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:46,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:46,335 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:46,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/../../sv-benchmarks/c/ldv-sets/test_add-2.i [2019-10-22 11:23:46,387 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/data/5fdcda589/391891a473ed4e2d957a2e68af8f0ae1/FLAG9a6371126 [2019-10-22 11:23:46,859 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:46,860 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/sv-benchmarks/c/ldv-sets/test_add-2.i [2019-10-22 11:23:46,871 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/data/5fdcda589/391891a473ed4e2d957a2e68af8f0ae1/FLAG9a6371126 [2019-10-22 11:23:47,365 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/data/5fdcda589/391891a473ed4e2d957a2e68af8f0ae1 [2019-10-22 11:23:47,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:47,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:47,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:47,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:47,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:47,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6c2dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47, skipping insertion in model container [2019-10-22 11:23:47,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,387 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:47,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:47,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:47,761 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:47,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:47,870 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:47,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47 WrapperNode [2019-10-22 11:23:47,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:47,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:47,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:47,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:47,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:47,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:47,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:47,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:47,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... [2019-10-22 11:23:47,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:47,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:47,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:47,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:47,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/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 [2019-10-22 11:23:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:23:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:23:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:48,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:23:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:48,321 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:48,321 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-10-22 11:23:48,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:48 BoogieIcfgContainer [2019-10-22 11:23:48,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:48,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:48,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:48,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:47" (1/3) ... [2019-10-22 11:23:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caddba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:48, skipping insertion in model container [2019-10-22 11:23:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:47" (2/3) ... [2019-10-22 11:23:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caddba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:48, skipping insertion in model container [2019-10-22 11:23:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:48" (3/3) ... [2019-10-22 11:23:48,329 INFO L109 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2019-10-22 11:23:48,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:48,342 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:48,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:48,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:48,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:48,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:48,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:48,372 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:48,372 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:48,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:48,372 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-22 11:23:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:48,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,392 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash -923442845, now seen corresponding path program 1 times [2019-10-22 11:23:48,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783566414] [2019-10-22 11:23:48,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:48,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783566414] [2019-10-22 11:23:48,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:48,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535589239] [2019-10-22 11:23:48,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:48,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:48,524 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-10-22 11:23:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,537 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-22 11:23:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:48,538 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 11:23:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,546 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:48,547 INFO L226 Difference]: Without dead ends: 19 [2019-10-22 11:23:48,549 INFO L600 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 [2019-10-22 11:23:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-22 11:23:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 11:23:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 11:23:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-22 11:23:48,578 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2019-10-22 11:23:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,579 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 11:23:48,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-22 11:23:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:48,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,579 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1228046979, now seen corresponding path program 1 times [2019-10-22 11:23:48,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271445341] [2019-10-22 11:23:48,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:48,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271445341] [2019-10-22 11:23:48,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:48,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329533893] [2019-10-22 11:23:48,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,637 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-10-22 11:23:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,677 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-10-22 11:23:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:48,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:23:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,678 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:23:48,679 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 11:23:48,679 INFO L600 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 [2019-10-22 11:23:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 11:23:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-10-22 11:23:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 11:23:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-22 11:23:48,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2019-10-22 11:23:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,683 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 11:23:48,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-22 11:23:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:48,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,684 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1885213511, now seen corresponding path program 1 times [2019-10-22 11:23:48,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068827441] [2019-10-22 11:23:48,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:48,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068827441] [2019-10-22 11:23:48,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:48,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964284011] [2019-10-22 11:23:48,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,838 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-10-22 11:23:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,925 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-22 11:23:48,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:48,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:23:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,927 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:23:48,927 INFO L226 Difference]: Without dead ends: 17 [2019-10-22 11:23:48,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-22 11:23:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 11:23:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 11:23:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 11:23:48,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-22 11:23:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,930 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 11:23:48,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-22 11:23:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:23:48,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,931 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2054053118, now seen corresponding path program 1 times [2019-10-22 11:23:48,932 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945425056] [2019-10-22 11:23:48,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:49,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945425056] [2019-10-22 11:23:49,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:49,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703288001] [2019-10-22 11:23:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:23:49,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:23:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:49,084 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-10-22 11:23:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,208 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-10-22 11:23:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:49,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-22 11:23:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,209 INFO L225 Difference]: With dead ends: 29 [2019-10-22 11:23:49,209 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:23:49,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:23:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-10-22 11:23:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 11:23:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-22 11:23:49,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-10-22 11:23:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,214 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-22 11:23:49,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:23:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-22 11:23:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:23:49,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:49,215 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:49,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:49,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:49,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2055661832, now seen corresponding path program 1 times [2019-10-22 11:23:49,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:49,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035321367] [2019-10-22 11:23:49,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:49,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035321367] [2019-10-22 11:23:49,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:49,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005702820] [2019-10-22 11:23:49,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:49,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:49,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:49,257 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-10-22 11:23:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,278 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-10-22 11:23:49,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:49,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 11:23:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,279 INFO L225 Difference]: With dead ends: 22 [2019-10-22 11:23:49,279 INFO L226 Difference]: Without dead ends: 18 [2019-10-22 11:23:49,279 INFO L600 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 [2019-10-22 11:23:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-22 11:23:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 11:23:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 11:23:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-10-22 11:23:49,283 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-10-22 11:23:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,283 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-10-22 11:23:49,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-10-22 11:23:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:49,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:49,284 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:49,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash -130550515, now seen corresponding path program 1 times [2019-10-22 11:23:49,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:49,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100033004] [2019-10-22 11:23:49,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:49,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100033004] [2019-10-22 11:23:49,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:23:49,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608540885] [2019-10-22 11:23:49,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:23:49,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:23:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:49,612 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-10-22 11:23:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,769 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-10-22 11:23:49,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:23:49,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-22 11:23:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,769 INFO L225 Difference]: With dead ends: 19 [2019-10-22 11:23:49,770 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:23:49,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:23:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:23:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:23:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:23:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:23:49,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-22 11:23:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,771 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:23:49,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:23:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:23:49,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:23:49,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:23:49,950 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 584) no Hoare annotation was computed. [2019-10-22 11:23:49,951 INFO L446 ceAbstractionStarter]: At program point L659(lines 656 660) the Hoare annotation is: true [2019-10-22 11:23:49,951 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:23:49,951 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:23:49,951 INFO L443 ceAbstractionStarter]: For program point L639-2(lines 639 643) no Hoare annotation was computed. [2019-10-22 11:23:49,951 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:23:49,951 INFO L439 ceAbstractionStarter]: At program point L639-3(lines 639 643) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 11:23:49,952 INFO L443 ceAbstractionStarter]: For program point L639-4(lines 639 643) no Hoare annotation was computed. [2019-10-22 11:23:49,952 INFO L443 ceAbstractionStarter]: For program point L639-7(lines 639 643) no Hoare annotation was computed. [2019-10-22 11:23:49,952 INFO L439 ceAbstractionStarter]: At program point L639-8(lines 639 643) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (.cse1 (+ |~#s1~0.offset| 4)) (.cse0 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (not (= |~#s1~0.base| .cse0)) (not (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base)) (= ULTIMATE.start_ldv_is_in_set_~e (select (select |#memory_int| ULTIMATE.start_ldv_is_in_set_~m~1.base) ULTIMATE.start_ldv_is_in_set_~m~1.offset)) (<= .cse1 .cse2) (<= .cse2 .cse1) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= 1 (select |#valid| |~#s1~0.base|)) (= (select (select |#memory_int| .cse0) |~#s1~0.offset|) ULTIMATE.start_foo_~j~0))) [2019-10-22 11:23:49,952 INFO L443 ceAbstractionStarter]: For program point L639-9(lines 639 643) no Hoare annotation was computed. [2019-10-22 11:23:49,952 INFO L439 ceAbstractionStarter]: At program point L565(lines 562 566) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= 0 |ULTIMATE.start_ldv_is_in_set_#res|) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= 0 |ULTIMATE.start_ldv_successful_malloc_#res.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 11:23:49,953 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 654) no Hoare annotation was computed. [2019-10-22 11:23:49,953 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 626) no Hoare annotation was computed. [2019-10-22 11:23:49,953 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 645) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= 0 |ULTIMATE.start_ldv_is_in_set_#res|) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 11:23:49,954 INFO L439 ceAbstractionStarter]: At program point L644-1(lines 637 645) the Hoare annotation is: (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= 1 |ULTIMATE.start_ldv_is_in_set_#res|) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= 1 (select |#valid| |~#s1~0.base|))) [2019-10-22 11:23:49,955 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:23:49,955 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 642) no Hoare annotation was computed. [2019-10-22 11:23:49,955 INFO L443 ceAbstractionStarter]: For program point L640-1(lines 640 642) no Hoare annotation was computed. [2019-10-22 11:23:49,955 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 625) no Hoare annotation was computed. [2019-10-22 11:23:49,956 INFO L443 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2019-10-22 11:23:49,956 INFO L443 ceAbstractionStarter]: For program point L654-1(line 654) no Hoare annotation was computed. [2019-10-22 11:23:49,956 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 655) no Hoare annotation was computed. [2019-10-22 11:23:49,966 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,967 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,972 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:49,972 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,976 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,977 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:49,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,980 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,982 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:49,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:49,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,989 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,993 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,993 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,994 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:49,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:49,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:49,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:49,996 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:49,997 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,005 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,010 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,012 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,019 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:50 BoogieIcfgContainer [2019-10-22 11:23:50,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:50,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:50,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:50,028 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:50,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:48" (3/4) ... [2019-10-22 11:23:50,031 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:23:50,044 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-10-22 11:23:50,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 11:23:50,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] [2019-10-22 11:23:50,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && !(s1 == \result)) && s1 == s) && 0 <= s1) && 0 == \result) && new == j) && 1 == \valid[s1] [2019-10-22 11:23:50,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && !(m == s)) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1]) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j [2019-10-22 11:23:50,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1] [2019-10-22 11:23:50,100 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_56c6ace0-d52a-4317-b586-23ce807e26fa/bin/utaipan/witness.graphml [2019-10-22 11:23:50,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:50,102 INFO L168 Benchmark]: Toolchain (without parser) took 2732.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.2 MB in the beginning and 908.6 MB in the end (delta: 30.5 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,102 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:50,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,103 INFO L168 Benchmark]: Boogie Preprocessor took 26.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:50,103 INFO L168 Benchmark]: RCFGBuilder took 381.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,104 INFO L168 Benchmark]: TraceAbstraction took 1697.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 180.5 MB). Peak memory consumption was 180.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,104 INFO L168 Benchmark]: Witness Printer took 73.04 ms. Allocated memory is still 1.2 GB. Free memory was 915.3 MB in the beginning and 908.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:50,106 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 381.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1697.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 180.5 MB). Peak memory consumption was 180.5 MB. Max. memory is 11.5 GB. * Witness Printer took 73.04 ms. Allocated memory is still 1.2 GB. Free memory was 915.3 MB in the beginning and 908.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 654]: 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: 637]: Loop Invariant [2019-10-22 11:23:50,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,117 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,117 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,117 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] - InvariantResult [Line: 637]: Loop Invariant [2019-10-22 11:23:50,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1] - InvariantResult [Line: 656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 639]: Loop Invariant [2019-10-22 11:23:50,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:50,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:50,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:50,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,124 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 11:23:50,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && !(m == s)) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1]) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j - InvariantResult [Line: 639]: Loop Invariant [2019-10-22 11:23:50,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] - InvariantResult [Line: 562]: Loop Invariant [2019-10-22 11:23:50,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 11:23:50,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 11:23:50,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 11:23:50,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 11:23:50,132 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && !(s1 == \result)) && s1 == s) && 0 <= s1) && 0 == \result) && new == j) && 1 == \valid[s1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 95 SDtfs, 107 SDslu, 107 SDs, 0 SdLazy, 89 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 282 HoareAnnotationTreeSize, 6 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 6023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...