./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/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 d80676b9a99131191df12fd74204f331d0509f64 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:20:18,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:20:18,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:20:18,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:20:18,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:20:18,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:20:18,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:20:18,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:20:18,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:20:18,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:20:18,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:20:18,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:20:18,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:20:18,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:20:18,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:20:18,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:20:18,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:20:18,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:20:18,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:20:18,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:20:18,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:20:18,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:20:18,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:20:18,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:20:18,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:20:18,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:20:18,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:20:18,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:20:18,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:20:18,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:20:18,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:20:18,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:20:18,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:20:18,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:20:18,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:20:18,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:20:18,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:20:18,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:20:18,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:20:18,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:20:18,973 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:20:18,974 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:20:18,974 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:20:18,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:20:18,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:20:18,976 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:18,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:20:18,976 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:20:18,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:20:18,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:20:18,977 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:20:18,977 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_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/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 -> d80676b9a99131191df12fd74204f331d0509f64 [2018-12-09 19:20:18,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:20:19,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:20:19,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:20:19,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:20:19,003 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:20:19,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-12-09 19:20:19,038 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/data/af68018d6/6e68e92392c842a69fe75ce64686449f/FLAG1af7b0e64 [2018-12-09 19:20:19,500 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:20:19,501 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-12-09 19:20:19,504 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/data/af68018d6/6e68e92392c842a69fe75ce64686449f/FLAG1af7b0e64 [2018-12-09 19:20:19,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/data/af68018d6/6e68e92392c842a69fe75ce64686449f [2018-12-09 19:20:19,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:20:19,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:20:19,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:19,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:20:19,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:20:19,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19, skipping insertion in model container [2018-12-09 19:20:19,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:20:19,535 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:20:19,629 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:19,632 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:20:19,649 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:19,660 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:20:19,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19 WrapperNode [2018-12-09 19:20:19,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:19,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:19,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:20:19,661 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:20:19,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:19,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:20:19,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:20:19,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:20:19,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... [2018-12-09 19:20:19,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:20:19,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:20:19,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:20:19,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:20:19,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/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-12-09 19:20:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:20:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:20:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:20:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:20:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:20:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:20:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:20:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:20:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:20:19,920 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:20:19,921 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 19:20:19,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:19 BoogieIcfgContainer [2018-12-09 19:20:19,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:20:19,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:20:19,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:20:19,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:20:19,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:20:19" (1/3) ... [2018-12-09 19:20:19,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adab7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:19, skipping insertion in model container [2018-12-09 19:20:19,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:19" (2/3) ... [2018-12-09 19:20:19,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adab7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:19, skipping insertion in model container [2018-12-09 19:20:19,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:19" (3/3) ... [2018-12-09 19:20:19,925 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-12-09 19:20:19,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:20:19,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-09 19:20:19,946 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-09 19:20:19,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:20:19,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:20:19,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:20:19,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:20:19,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:20:19,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:20:19,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:20:19,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:20:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-12-09 19:20:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 19:20:19,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:19,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:19,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:19,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-12-09 19:20:19,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:20,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:20,106 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-12-09 19:20:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:20,129 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-12-09 19:20:20,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:20,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 19:20:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:20,136 INFO L225 Difference]: With dead ends: 56 [2018-12-09 19:20:20,136 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 19:20:20,138 INFO L631 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-12-09 19:20:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 19:20:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-09 19:20:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 19:20:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-09 19:20:20,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-12-09 19:20:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-09 19:20:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-09 19:20:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:20:20,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:20,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-12-09 19:20:20,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:20,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:20,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:20,193 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-12-09 19:20:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:20,217 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-12-09 19:20:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:20,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-09 19:20:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:20,218 INFO L225 Difference]: With dead ends: 53 [2018-12-09 19:20:20,218 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 19:20:20,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 19:20:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-12-09 19:20:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 19:20:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-09 19:20:20,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-12-09 19:20:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-09 19:20:20,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-09 19:20:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:20:20,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:20,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-12-09 19:20:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:20,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:20,247 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-12-09 19:20:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:20,270 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-12-09 19:20:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:20,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 19:20:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:20,271 INFO L225 Difference]: With dead ends: 62 [2018-12-09 19:20:20,271 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 19:20:20,271 INFO L631 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-12-09 19:20:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 19:20:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-12-09 19:20:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 19:20:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-09 19:20:20,274 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-12-09 19:20:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,275 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-09 19:20:20,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-09 19:20:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 19:20:20,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:20,275 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,275 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-12-09 19:20:20,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:20,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:20,293 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-12-09 19:20:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:20,310 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-12-09 19:20:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:20,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 19:20:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:20,310 INFO L225 Difference]: With dead ends: 56 [2018-12-09 19:20:20,310 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 19:20:20,311 INFO L631 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-12-09 19:20:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 19:20:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-12-09 19:20:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 19:20:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 19:20:20,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-12-09 19:20:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,313 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 19:20:20,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 19:20:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:20:20,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:20,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-12-09 19:20:20,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,915 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 36 [2018-12-09 19:20:21,078 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 41 [2018-12-09 19:20:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:20:21,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:20:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:20:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:20:21,128 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2018-12-09 19:20:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,348 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-09 19:20:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:20:21,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 19:20:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,349 INFO L225 Difference]: With dead ends: 49 [2018-12-09 19:20:21,349 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 19:20:21,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:20:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 19:20:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 19:20:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 19:20:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 19:20:21,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-12-09 19:20:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,353 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 19:20:21,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:20:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 19:20:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:20:21,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,353 INFO L402 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-12-09 19:20:21,354 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2018-12-09 19:20:21,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:21,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:21,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:21,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:21,391 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-12-09 19:20:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,424 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 19:20:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:20:21,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 19:20:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,425 INFO L225 Difference]: With dead ends: 44 [2018-12-09 19:20:21,425 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 19:20:21,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:20:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 19:20:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-12-09 19:20:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 19:20:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-09 19:20:21,429 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-12-09 19:20:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,430 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-09 19:20:21,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-09 19:20:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:20:21,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,430 INFO L402 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] [2018-12-09 19:20:21,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2018-12-09 19:20:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:21,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:21,509 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-12-09 19:20:21,511 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2018-12-09 19:20:21,534 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:21,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:21,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:21,635 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 120 root evaluator evaluations with a maximum evaluation depth of 6. Performed 120 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-09 19:20:21,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:21,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:21,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:20:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:21,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-09 19:20:21,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:21,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:21,802 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-12-09 19:20:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:28,439 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-09 19:20:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:28,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-09 19:20:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:28,440 INFO L225 Difference]: With dead ends: 47 [2018-12-09 19:20:28,440 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 19:20:28,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 19:20:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-09 19:20:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 19:20:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-09 19:20:28,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-12-09 19:20:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:28,453 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-09 19:20:28,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-09 19:20:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:20:28,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:28,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:20:28,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:28,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1779426667, now seen corresponding path program 1 times [2018-12-09 19:20:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:28,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:28,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:34,443 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-09 19:20:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:36,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:36,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:20:36,967 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-09 19:20:36,967 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [50], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2018-12-09 19:20:36,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:20:36,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:20:37,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:20:37,022 INFO L272 AbstractInterpreter]: Visited 27 different actions 29 times. Merged at 2 different actions 2 times. Never widened. Performed 172 root evaluator evaluations with a maximum evaluation depth of 6. Performed 172 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 39 variables. [2018-12-09 19:20:37,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:37,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:20:37,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:20:37,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/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-12-09 19:20:37,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:37,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:20:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:37,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:20:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:39,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:20:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:41,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:20:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 13 [2018-12-09 19:20:41,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:20:41,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:20:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:20:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=110, Unknown=3, NotChecked=0, Total=156 [2018-12-09 19:20:41,494 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 11 states. [2018-12-09 19:20:52,798 WARN L180 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-12-09 19:20:55,639 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-09 19:20:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:58,338 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-09 19:20:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:58,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-12-09 19:20:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:58,344 INFO L225 Difference]: With dead ends: 39 [2018-12-09 19:20:58,344 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:20:58,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=73, Invalid=162, Unknown=5, NotChecked=0, Total=240 [2018-12-09 19:20:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:20:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:20:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:20:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:20:58,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-12-09 19:20:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:58,345 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:20:58,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:20:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:20:58,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:20:58,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:21:09,054 WARN L180 SmtUtils]: Spent 10.65 s on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2018-12-09 19:21:18,773 WARN L180 SmtUtils]: Spent 9.72 s on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2018-12-09 19:21:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:21:18,822 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:21:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:21:18,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:21:18,822 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:21:18,823 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:21:18,823 INFO L451 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-12-09 19:21:18,823 INFO L444 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse10 (div main_~main__index1~0 4294967296)) (.cse9 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (* 4294967296 .cse9)) (.cse3 (+ (* 4294967296 .cse10) main_~main__index2~0)) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse1 99999)) .cse2 (<= (+ main_~main__index1~0 .cse1 1) .cse3)) (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) .cse0 (or (let ((.cse8 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse8 (+ (* (- 17179869184) .cse10) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse7 (select .cse8 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse9))))) (let ((.cse6 (* 4294967296 (div .cse7 4294967296))) (.cse4 (+ (* 4294967296 (div .cse5 4294967296)) .cse7))) (and (<= .cse4 (+ .cse5 .cse6)) (<= (+ .cse6 .cse5) .cse4))))) (<= (+ main_~main__index1~0 .cse1) .cse3)) .cse2)))) [2018-12-09 19:21:18,823 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~main__index1~0 4294967296))) (.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 .cse0 1) (+ .cse1 main_~main__index2~0)) (<= (+ .cse1 (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) 1) (+ main_~main__index1~0 .cse0)))) [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-12-09 19:21:18,824 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 .cse2 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (and .cse0 (= main_~main____CPAchecker_TMP_0~0 1) .cse1 .cse2))) (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L444 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-12-09 19:21:18,825 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-12-09 19:21:18,825 INFO L444 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (+ (- main_~main__index2~0) 4294967294)) 4294967296)) (+ main_~main__index1~0 (- 1))) 4294967296)) 99998)) (= |main_~#main__array~0.offset| 0) (not (= 0 main_~__VERIFIER_assert__cond~2)) (= main_~__VERIFIER_assert__cond~0 1)) [2018-12-09 19:21:18,826 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-09 19:21:18,826 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-12-09 19:21:18,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:21:18 BoogieIcfgContainer [2018-12-09 19:21:18,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:21:18,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:21:18,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:21:18,841 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:21:18,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:19" (3/4) ... [2018-12-09 19:21:18,845 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:21:18,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:21:18,850 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:21:18,854 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-09 19:21:18,855 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 19:21:18,855 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:21:18,902 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f1dc2f60-2ce3-4bc9-8d8b-3ce17a020873/bin-2019/utaipan/witness.graphml [2018-12-09 19:21:18,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:21:18,903 INFO L168 Benchmark]: Toolchain (without parser) took 59388.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 953.5 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 128.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,903 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:21:18,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.98 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,904 INFO L168 Benchmark]: Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,904 INFO L168 Benchmark]: RCFGBuilder took 192.10 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,905 INFO L168 Benchmark]: TraceAbstraction took 58919.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.4 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:21:18,905 INFO L168 Benchmark]: Witness Printer took 60.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:21:18,906 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.98 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 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 49.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.10 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58919.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.4 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. * Witness Printer took 60.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-12-09 19:21:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 19:21:18,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__array == 0 && !(0 == __VERIFIER_assert__cond)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || (((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + (-main__index2 + 4294967294)) / 4294967296) + (main__index1 + -1)) / 4294967296) + 99998 && main__array == 0) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] <= 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((main__array == 0 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * (main__index1 / 4294967296) + 4294967296 * ((main__index2 + 4294867297) / 4294967296) + 1 <= main__index1 + 4294967296 * (main__index2 / 4294967296) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((main__array == 0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(0 == __VERIFIER_assert__cond)) || (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 58.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 20.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 286 SDslu, 334 SDs, 0 SdLazy, 236 SolverSat, 36 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 27.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 25 NumberOfFragments, 403 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1929 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 796 FormulaSimplificationTreeSizeReductionInter, 20.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 59586 SizeOfPredicates, 6 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 14/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...