./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.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_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/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 a0a39eefaccc62f602b71ff7e91e6bcef4799631 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:17:47,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:17:47,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:17:47,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:17:47,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:17:47,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:17:47,928 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:17:47,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:17:47,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:17:47,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:17:47,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:17:47,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:17:47,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:17:47,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:17:47,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:17:47,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:17:47,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:17:47,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:17:47,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:17:47,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:17:47,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:17:47,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:17:47,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:17:47,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:17:47,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:17:47,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:17:47,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:17:47,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:17:47,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:17:47,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:17:47,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:17:47,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:17:47,950 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:17:47,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:17:47,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:17:47,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:17:47,951 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:17:47,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:17:47,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:17:47,964 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:17:47,964 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:17:47,964 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:17:47,964 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:17:47,965 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:17:47,965 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:17:47,965 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:17:47,965 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:17:47,965 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:17:47,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:17:47,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:17:47,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:17:47,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:17:47,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:17:47,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:17:47,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:17:47,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:17:47,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:17:47,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:17:47,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:17:47,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:17:47,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:17:47,971 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_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/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 -> a0a39eefaccc62f602b71ff7e91e6bcef4799631 [2018-10-26 22:17:47,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:17:48,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:17:48,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:17:48,010 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:17:48,011 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:17:48,011 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/../../sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-10-26 22:17:48,059 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/data/6ac3e2fed/b23fc38b650b480b890994d7d4e1ebdb/FLAG6781b2d03 [2018-10-26 22:17:48,437 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:17:48,437 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/sv-benchmarks/c/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-10-26 22:17:48,443 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/data/6ac3e2fed/b23fc38b650b480b890994d7d4e1ebdb/FLAG6781b2d03 [2018-10-26 22:17:48,453 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/data/6ac3e2fed/b23fc38b650b480b890994d7d4e1ebdb [2018-10-26 22:17:48,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:17:48,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:17:48,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:17:48,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:17:48,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:17:48,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37154146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48, skipping insertion in model container [2018-10-26 22:17:48,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:17:48,492 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:17:48,644 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:17:48,650 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:17:48,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:17:48,679 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:17:48,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48 WrapperNode [2018-10-26 22:17:48,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:17:48,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:17:48,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:17:48,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:17:48,687 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:17:48" (1/1) ... [2018-10-26 22:17:48,693 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:17:48" (1/1) ... [2018-10-26 22:17:48,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:17:48,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:17:48,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:17:48,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:17:48,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... [2018-10-26 22:17:48,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:17:48,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:17:48,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:17:48,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:17:48,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/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:17:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-10-26 22:17:48,829 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-10-26 22:17:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:17:48,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:17:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:17:48,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:17:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:17:48,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:17:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 22:17:48,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 22:17:49,203 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:17:49,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:17:49 BoogieIcfgContainer [2018-10-26 22:17:49,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:17:49,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:17:49,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:17:49,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:17:49,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:17:48" (1/3) ... [2018-10-26 22:17:49,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d96635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:17:49, skipping insertion in model container [2018-10-26 22:17:49,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:17:48" (2/3) ... [2018-10-26 22:17:49,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d96635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:17:49, skipping insertion in model container [2018-10-26 22:17:49,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:17:49" (3/3) ... [2018-10-26 22:17:49,210 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-10-26 22:17:49,218 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:17:49,223 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:17:49,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:17:49,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:17:49,254 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:17:49,254 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:17:49,254 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:17:49,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:17:49,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:17:49,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:17:49,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:17:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-26 22:17:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:17:49,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:49,273 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] [2018-10-26 22:17:49,275 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:49,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1280416473, now seen corresponding path program 1 times [2018-10-26 22:17:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:49,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:49,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:49,392 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:17:49,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:49,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:17:49,397 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:17:49,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:17:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:17:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:17:49,416 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-26 22:17:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:49,438 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-10-26 22:17:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:17:49,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 22:17:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:49,446 INFO L225 Difference]: With dead ends: 61 [2018-10-26 22:17:49,446 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 22:17:49,449 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:17:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 22:17:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-26 22:17:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-26 22:17:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-10-26 22:17:49,478 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2018-10-26 22:17:49,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:49,479 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-26 22:17:49,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:17:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-10-26 22:17:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 22:17:49,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:49,480 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] [2018-10-26 22:17:49,481 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:49,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1572312329, now seen corresponding path program 1 times [2018-10-26 22:17:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:49,552 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:17:49,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:49,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:17:49,553 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:17:49,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:17:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:17:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:17:49,555 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-10-26 22:17:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:49,628 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-10-26 22:17:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:17:49,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 22:17:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:49,632 INFO L225 Difference]: With dead ends: 54 [2018-10-26 22:17:49,632 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 22:17:49,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:17:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 22:17:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-10-26 22:17:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 22:17:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-26 22:17:49,643 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2018-10-26 22:17:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:49,643 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-26 22:17:49,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:17:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-26 22:17:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:17:49,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:49,645 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] [2018-10-26 22:17:49,645 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:49,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash -544729024, now seen corresponding path program 1 times [2018-10-26 22:17:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:17:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:17:49,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:17:49,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:17:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:17:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:17:49,702 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-26 22:17:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:49,750 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-10-26 22:17:49,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:17:49,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 22:17:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:49,752 INFO L225 Difference]: With dead ends: 54 [2018-10-26 22:17:49,752 INFO L226 Difference]: Without dead ends: 33 [2018-10-26 22:17:49,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:17:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-26 22:17:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-26 22:17:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 22:17:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-10-26 22:17:49,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2018-10-26 22:17:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:49,758 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-10-26 22:17:49,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:17:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-10-26 22:17:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:17:49,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:49,759 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] [2018-10-26 22:17:49,759 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:49,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash -286563586, now seen corresponding path program 1 times [2018-10-26 22:17:49,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:49,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:17:49,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:49,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:17:49,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 22:17:49,860 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [15], [16], [17], [21], [23], [27], [30], [32], [37], [39], [43], [47], [52], [55], [67], [70], [72], [78], [79], [80], [82], [83], [84] [2018-10-26 22:17:49,899 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:17:49,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:17:50,033 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:17:50,035 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Never found a fixpoint. Largest state had 31 variables. [2018-10-26 22:17:50,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:50,046 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:17:50,147 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 90.03% of their original sizes. [2018-10-26 22:17:50,148 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:17:50,273 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-10-26 22:17:50,273 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:17:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:17:50,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-26 22:17:50,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:17:50,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:17:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:17:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:17:50,275 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-10-26 22:17:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:50,655 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-10-26 22:17:50,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:17:50,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-26 22:17:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:50,656 INFO L225 Difference]: With dead ends: 58 [2018-10-26 22:17:50,656 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 22:17:50,657 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 23 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:17:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 22:17:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-26 22:17:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-26 22:17:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-26 22:17:50,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2018-10-26 22:17:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:50,665 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-26 22:17:50,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:17:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-26 22:17:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 22:17:50,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:50,667 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] [2018-10-26 22:17:50,667 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:50,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -857745344, now seen corresponding path program 1 times [2018-10-26 22:17:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:50,670 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:50,736 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:17:50,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:50,736 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:17:50,736 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-26 22:17:50,737 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [21], [23], [27], [30], [32], [37], [39], [43], [47], [52], [55], [67], [70], [72], [78], [79], [80], [82], [83], [84] [2018-10-26 22:17:50,739 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:17:50,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:17:51,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:17:51,464 INFO L272 AbstractInterpreter]: Visited 28 different actions 106 times. Merged at 7 different actions 60 times. Widened at 2 different actions 10 times. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-10-26 22:17:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:51,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:17:51,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:51,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:17:51,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:51,498 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:17:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:51,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:51,732 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:17:51,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:17:52,068 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:17:52,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:17:52,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2018-10-26 22:17:52,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:17:52,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:17:52,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:17:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:17:52,093 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2018-10-26 22:17:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:52,412 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-10-26 22:17:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:17:52,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-10-26 22:17:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:52,413 INFO L225 Difference]: With dead ends: 79 [2018-10-26 22:17:52,413 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 22:17:52,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:17:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 22:17:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-10-26 22:17:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-26 22:17:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-10-26 22:17:52,420 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 30 [2018-10-26 22:17:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:52,420 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-26 22:17:52,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:17:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-10-26 22:17:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 22:17:52,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:17:52,421 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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:17:52,421 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:17:52,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:17:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -215711675, now seen corresponding path program 2 times [2018-10-26 22:17:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:17:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:17:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:17:52,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:17:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:17:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:17:52,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:52,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:17:52,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:17:52,493 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:17:52,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:17:52,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/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:17:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:17:52,513 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:17:52,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 22:17:52,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:17:52,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:17:52,667 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 15 treesize of output 12 [2018-10-26 22:17:52,682 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 12 treesize of output 11 [2018-10-26 22:17:52,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:52,702 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:17:52,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-26 22:17:53,101 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 24 treesize of output 20 [2018-10-26 22:17:53,133 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 1 case distinctions, treesize of input 20 treesize of output 21 [2018-10-26 22:17:53,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 22:17:53,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:17:53,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:17:53,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-10-26 22:17:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:17:53,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:17:53,989 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:17:53,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:53,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:53,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:1 [2018-10-26 22:17:54,110 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 16 treesize of output 14 [2018-10-26 22:17:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-10-26 22:17:54,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:54,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:54,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-10-26 22:17:54,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-10-26 22:17:54,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:17:54,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:17:54,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 22:17:54,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-10-26 22:17:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 22:17:54,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:17:54,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 19 [2018-10-26 22:17:54,310 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:17:54,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:17:54,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:17:54,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-10-26 22:17:54,311 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 13 states. [2018-10-26 22:17:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:17:54,622 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-10-26 22:17:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:17:54,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-10-26 22:17:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:17:54,623 INFO L225 Difference]: With dead ends: 51 [2018-10-26 22:17:54,623 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:17:54,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-10-26 22:17:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:17:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:17:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:17:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:17:54,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-10-26 22:17:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:17:54,624 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:17:54,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:17:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:17:54,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:17:54,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:17:54,873 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2018-10-26 22:17:54,982 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2018-10-26 22:17:54,984 INFO L428 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point L12-3(lines 12 15) no Hoare annotation was computed. [2018-10-26 22:17:54,984 INFO L421 ceAbstractionStarter]: At program point L12-4(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= init_~a.offset |init_#in~a.offset|))) (or (and .cse0 (= |init_#in~size| init_~size) (exists ((v_init_~i~0_15 Int)) (and (< v_init_~i~0_15 init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 v_init_~i~0_15))))) (<= init_~i~0 (+ v_init_~i~0_15 1)))) .cse1) (< 200000 (* 2 |init_#in~size|)) (let ((.cse3 (* 2 init_~size)) (.cse2 (+ init_~i~0 100000))) (and .cse0 (<= init_~size .cse2) (<= .cse3 200000) (<= 200000 .cse3) (<= .cse2 init_~size) .cse1)) (< (+ |init_#in~size| |init_#in~a.offset|) 100000) (< 0 (* 2 |init_#in~a.offset|)))) [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point L12-5(lines 9 16) no Hoare annotation was computed. [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:17:54,984 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:17:54,984 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 22:17:54,985 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L421 ceAbstractionStarter]: At program point L31-4(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point L31-5(lines 31 35) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-10-26 22:17:54,985 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 30) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 24 30) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L421 ceAbstractionStarter]: At program point L24-4(lines 24 30) the Hoare annotation is: (or (= main_~flag~0 1) (and (exists ((v_init_~i~0_15 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_15) |main_~#a~0.offset|)) 0)) (<= 99999 v_init_~i~0_15) (< v_init_~i~0_15 100000))) (<= main_~i~1 99999) (= main_~flag~0 0) (= |main_~#a~0.offset| 0))) [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L24-5(lines 24 30) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2018-10-26 22:17:54,986 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-10-26 22:17:54,987 INFO L425 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2018-10-26 22:17:54,987 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-10-26 22:17:54,995 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:54,995 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,996 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,996 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:54,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:54,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,998 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:54,999 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:54,999 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:55,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,000 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:55,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,001 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:55,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,002 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:55,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:17:55 BoogieIcfgContainer [2018-10-26 22:17:55,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:17:55,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:17:55,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:17:55,009 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:17:55,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:17:49" (3/4) ... [2018-10-26 22:17:55,014 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 22:17:55,019 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-10-26 22:17:55,019 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 22:17:55,019 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 22:17:55,019 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-26 22:17:55,023 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2018-10-26 22:17:55,024 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-10-26 22:17:55,024 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-10-26 22:17:55,024 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 22:17:55,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: flag == 1 || ((((\exists v_init_~i~0_15 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_15 + a] == 0) && 99999 <= v_init_~i~0_15) && v_init_~i~0_15 < 100000) && i <= 99999) && flag == 0) && a == 0) [2018-10-26 22:17:55,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((a == a && \old(size) == size) && (\exists v_init_~i~0_15 : int :: (v_init_~i~0_15 < size && !(0 == #memory_$Pointer$[a][a + 4 * v_init_~i~0_15])) && i <= v_init_~i~0_15 + 1)) && a == a) || 200000 < 2 * \old(size)) || (((((a == a && size <= i + 100000) && 2 * size <= 200000) && 200000 <= 2 * size) && i + 100000 <= size) && a == a)) || \old(size) + a < 100000) || 0 < 2 * a [2018-10-26 22:17:55,066 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36c12074-d1fe-48cc-b4e9-d1f5f4d13e65/bin-2019/utaipan/witness.graphml [2018-10-26 22:17:55,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:17:55,066 INFO L168 Benchmark]: Toolchain (without parser) took 6610.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -219.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:17:55,067 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:17:55,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:17:55,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:17:55,068 INFO L168 Benchmark]: Boogie Preprocessor took 18.73 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:17:55,068 INFO L168 Benchmark]: RCFGBuilder took 475.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:17:55,069 INFO L168 Benchmark]: TraceAbstraction took 5803.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:17:55,069 INFO L168 Benchmark]: Witness Printer took 57.28 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.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:17:55,071 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.73 ms. Allocated memory is still 1.0 GB. Free memory is still 941.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 475.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5803.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. * Witness Printer took 57.28 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.2 MB). Peak memory consumption was 6.2 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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,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_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,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_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,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_init_~i~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 4]: 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: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2018-10-26 22:17:55,079 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:55,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,079 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,090 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:55,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:17:55,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,091 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: flag == 1 || ((((\exists v_init_~i~0_15 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_15 + a] == 0) && 99999 <= v_init_~i~0_15) && v_init_~i~0_15 < 100000) && i <= 99999) && flag == 0) && a == 0) - InvariantResult [Line: 12]: Loop Invariant [2018-10-26 22:17:55,091 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,091 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:55,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,092 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,092 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:17:55,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,093 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:17:55,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,093 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_15,QUANTIFIED] [2018-10-26 22:17:55,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((a == a && \old(size) == size) && (\exists v_init_~i~0_15 : int :: (v_init_~i~0_15 < size && !(0 == #memory_$Pointer$[a][a + 4 * v_init_~i~0_15])) && i <= v_init_~i~0_15 + 1)) && a == a) || 200000 < 2 * \old(size)) || (((((a == a && size <= i + 100000) && 2 * size <= 200000) && 200000 <= 2 * size) && i + 100000 <= size) && a == a)) || \old(size) + a < 100000) || 0 < 2 * a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 177 SDtfs, 70 SDslu, 305 SDs, 0 SdLazy, 130 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 186 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9706042401288582 AbsIntWeakeningRatio, 1.4230769230769231 AbsIntAvgWeakeningVarsNumRemoved, 22.615384615384617 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 25 NumberOfFragments, 129 HoareAnnotationTreeSize, 16 FomulaSimplifications, 84 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 501 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 232 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 289 ConstructedInterpolants, 28 QuantifiedInterpolants, 40777 SizeOfPredicates, 22 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 23/61 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...