./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/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_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/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-1dbac8b [2018-10-26 22:18:45,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:18:45,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:18:45,918 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:18:45,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:18:45,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:18:45,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:18:45,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:18:45,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:18:45,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:18:45,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:18:45,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:18:45,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:18:45,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:18:45,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:18:45,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:18:45,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:18:45,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:18:45,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:18:45,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:18:45,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:18:45,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:18:45,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:18:45,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:18:45,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:18:45,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:18:45,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:18:45,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:18:45,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:18:45,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:18:45,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:18:45,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:18:45,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:18:45,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:18:45,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:18:45,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:18:45,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:18:45,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:18:45,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:18:45,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:18:45,977 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:18:45,977 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:18:45,977 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:18:45,977 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:18:45,978 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:18:45,978 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:18:45,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:18:45,978 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:18:45,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:18:45,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:18:45,980 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:18:45,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:18:45,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:18:45,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:18:45,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:18:45,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:18:45,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:18:45,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:18:45,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:18:45,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:18:45,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:18:45,983 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:18:45,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:18:45,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:18:45,983 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:18:45,983 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_bf6ece15-4227-4913-82df-1de6d46c514a/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-10-26 22:18:46,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:18:46,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:18:46,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:18:46,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:18:46,040 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:18:46,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-26 22:18:46,096 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/data/922eccc31/2b4a61741c024546bd416545fa77601e/FLAG694e648cf [2018-10-26 22:18:46,432 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:18:46,433 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-26 22:18:46,439 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/data/922eccc31/2b4a61741c024546bd416545fa77601e/FLAG694e648cf [2018-10-26 22:18:46,451 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/data/922eccc31/2b4a61741c024546bd416545fa77601e [2018-10-26 22:18:46,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:18:46,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:18:46,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:18:46,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:18:46,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:18:46,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb44556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46, skipping insertion in model container [2018-10-26 22:18:46,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:18:46,493 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:18:46,628 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:18:46,632 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:18:46,657 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:18:46,673 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:18:46,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46 WrapperNode [2018-10-26 22:18:46,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:18:46,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:18:46,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:18:46,675 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:18:46,682 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:18:46" (1/1) ... [2018-10-26 22:18:46,690 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:18:46" (1/1) ... [2018-10-26 22:18:46,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:18:46,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:18:46,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:18:46,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:18:46,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... [2018-10-26 22:18:46,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:18:46,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:18:46,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:18:46,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:18:46,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/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:18:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:18:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:18:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:18:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:18:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:18:46,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:18:47,404 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:18:47,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:18:47 BoogieIcfgContainer [2018-10-26 22:18:47,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:18:47,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:18:47,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:18:47,409 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:18:47,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:18:46" (1/3) ... [2018-10-26 22:18:47,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b89f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:18:47, skipping insertion in model container [2018-10-26 22:18:47,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:46" (2/3) ... [2018-10-26 22:18:47,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b89f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:18:47, skipping insertion in model container [2018-10-26 22:18:47,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:18:47" (3/3) ... [2018-10-26 22:18:47,412 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-26 22:18:47,421 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:18:47,428 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-26 22:18:47,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-10-26 22:18:47,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:18:47,481 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:18:47,481 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:18:47,481 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:18:47,481 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:18:47,481 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:18:47,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:18:47,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:18:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-26 22:18:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 22:18:47,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:47,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:47,510 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:47,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-10-26 22:18:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:18:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:47,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:18:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:47,738 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:18:47,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:47,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:18:47,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:18:47,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:18:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:18:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:18:47,760 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-10-26 22:18:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:47,820 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-10-26 22:18:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:18:47,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-26 22:18:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:47,829 INFO L225 Difference]: With dead ends: 56 [2018-10-26 22:18:47,830 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 22:18:47,833 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:18:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 22:18:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-10-26 22:18:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-26 22:18:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-10-26 22:18:47,865 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-10-26 22:18:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:47,865 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-10-26 22:18:47,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:18:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-10-26 22:18:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 22:18:47,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:47,866 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:47,866 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:47,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-10-26 22:18:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:18:47,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:47,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:47,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:18:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:47,985 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:18:47,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:18:47,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:18:47,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:18:47,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:18:47,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:18:47,988 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-10-26 22:18:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:48,130 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-10-26 22:18:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:18:48,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-26 22:18:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:48,133 INFO L225 Difference]: With dead ends: 53 [2018-10-26 22:18:48,133 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 22:18:48,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:18:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 22:18:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-26 22:18:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 22:18:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-10-26 22:18:48,140 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-10-26 22:18:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:48,141 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-10-26 22:18:48,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:18:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-10-26 22:18:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 22:18:48,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:48,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:48,142 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-10-26 22:18:48,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:18:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:48,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:18:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:48,189 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:18:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:48,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:18:48,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:18:48,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:18:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:18:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:18:48,194 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-10-26 22:18:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:48,257 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-10-26 22:18:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:18:48,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-26 22:18:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:48,259 INFO L225 Difference]: With dead ends: 62 [2018-10-26 22:18:48,259 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 22:18:48,259 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:18:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 22:18:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-10-26 22:18:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 22:18:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 22:18:48,264 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-10-26 22:18:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:48,264 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 22:18:48,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:18:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 22:18:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:18:48,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:48,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:48,265 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:48,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-10-26 22:18:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:18:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:18:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:48,317 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:18:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:18:48,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:18:48,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:18:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:18:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:18:48,319 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-10-26 22:18:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:48,385 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-10-26 22:18:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:18:48,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-26 22:18:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:48,386 INFO L225 Difference]: With dead ends: 56 [2018-10-26 22:18:48,386 INFO L226 Difference]: Without dead ends: 35 [2018-10-26 22:18:48,387 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:18:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-26 22:18:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-26 22:18:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 22:18:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-26 22:18:48,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-10-26 22:18:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:48,390 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-26 22:18:48,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:18:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-10-26 22:18:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 22:18:48,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:48,391 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] [2018-10-26 22:18:48,391 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:48,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-10-26 22:18:48,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:18:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:48,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:18:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:48,978 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-26 22:18:49,192 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-26 22:18:49,640 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-10-26 22:19:00,984 WARN L179 SmtUtils]: Spent 7.08 s on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-10-26 22:19:03,609 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-10-26 22:19:03,628 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:19:03,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:19:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 22:19:03,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:19:03,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:19:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:19:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=72, Unknown=3, NotChecked=0, Total=110 [2018-10-26 22:19:03,630 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 11 states. [2018-10-26 22:19:27,301 WARN L179 SmtUtils]: Spent 23.37 s on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2018-10-26 22:19:57,121 WARN L179 SmtUtils]: Spent 22.80 s on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2018-10-26 22:20:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:20:04,249 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-10-26 22:20:04,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:20:04,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-26 22:20:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:20:04,252 INFO L225 Difference]: With dead ends: 75 [2018-10-26 22:20:04,252 INFO L226 Difference]: Without dead ends: 54 [2018-10-26 22:20:04,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=84, Invalid=184, Unknown=4, NotChecked=0, Total=272 [2018-10-26 22:20:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-26 22:20:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2018-10-26 22:20:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 22:20:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-26 22:20:04,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-10-26 22:20:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:20:04,259 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-26 22:20:04,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:20:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-26 22:20:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:20:04,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:20:04,262 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:20:04,262 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:20:04,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:20:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2018-10-26 22:20:04,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:20:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:04,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:20:04,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:04,264 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:20:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:04,613 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:20:04,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:20:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:20:04,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:20:04,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:20:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:20:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:20:04,615 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-10-26 22:20:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:20:04,719 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-10-26 22:20:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:20:04,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-26 22:20:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:20:04,720 INFO L225 Difference]: With dead ends: 50 [2018-10-26 22:20:04,720 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 22:20:04,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:20:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 22:20:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-10-26 22:20:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 22:20:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-26 22:20:04,727 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2018-10-26 22:20:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:20:04,727 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-26 22:20:04,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:20:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-26 22:20:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 22:20:04,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:20:04,728 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:20:04,729 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:20:04,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:20:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1270030792, now seen corresponding path program 1 times [2018-10-26 22:20:04,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:20:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:04,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:20:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:04,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:20:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:04,830 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:20:04,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:20:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:20:04,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:20:04,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:20:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:20:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:20:04,832 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-10-26 22:20:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:20:05,033 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-10-26 22:20:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:20:05,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-26 22:20:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:20:05,034 INFO L225 Difference]: With dead ends: 67 [2018-10-26 22:20:05,035 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 22:20:05,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:20:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 22:20:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2018-10-26 22:20:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 22:20:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-10-26 22:20:05,040 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 21 [2018-10-26 22:20:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:20:05,042 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-10-26 22:20:05,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:20:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-10-26 22:20:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:20:05,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:20:05,043 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] [2018-10-26 22:20:05,043 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:20:05,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:20:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -547040660, now seen corresponding path program 1 times [2018-10-26 22:20:05,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:20:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:20:05,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:20:05,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:20:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:05,605 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-26 22:20:05,879 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-26 22:20:08,067 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~main__index1~0 (- 1))) (.cse3 (+ c_main_~main__index1~0 4294867295))) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div .cse0 4294967296)) 100000)) (let ((.cse1 (- c_main_~main__index2~0))) (or (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse1 (+ c_main_~main__index1~0 8589834591)) 4294967296)) .cse0) 4294967296)) 99998)) (let ((.cse2 (* (- 4294967296) (div (+ .cse1 .cse3) 4294967296)))) (and (<= (* 4294967296 (div (+ .cse2 .cse3) 4294967296)) c_main_~main__index2~0) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse2 .cse0) 4294967296)) 99998)))))) (<= (+ (* 4294967296 (div .cse3 4294967296)) 1) c_main_~main__index1~0))) is different from false [2018-10-26 22:20:24,128 WARN L179 SmtUtils]: Spent 10.97 s on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-10-26 22:20:52,712 WARN L179 SmtUtils]: Spent 26.29 s on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-10-26 22:21:48,329 WARN L179 SmtUtils]: Spent 41.45 s on a formula simplification. DAG size of input: 118 DAG size of output: 70 [2018-10-26 22:21:50,345 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div (+ c_main_~main__index1~0 (- 2)) 4294967296))) (let ((.cse10 (* 17179869184 .cse13))) (let ((.cse11 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse7 (+ (* (- 4) c_main_~main__index1~0) (+ .cse10 (- |c_main_~#main__array~0.offset|)))) (.cse12 (* 4 c_main_~main__index1~0)) (.cse9 (* 4 c_main_~main__index2~0))) (let ((.cse0 (* 4294967296 .cse13)) (.cse1 (div (+ (* (- 17179869184) .cse11) (+ .cse7 (+ .cse12 (+ |c_main_~#main__array~0.offset| (+ (* (- 17179869184) (div (+ c_main_~main__index1~0 4294767296) 4294967296)) .cse9))))) 4))) (and (<= c_main_~main__index1~0 (+ .cse0 .cse1 1)) (let ((.cse2 (- c_main_~main__index2~0))) (or (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse2 8589834589)) 4294967296)) (- 2))) 4294967296)) 99997)) (let ((.cse3 (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse2 4294867293)) 4294967296)))) (and (<= (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294867294)) 4294967296)) (+ c_main_~main__index2~0 1)) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 (- 2))) 4294967296)) 99997)))))) (or (<= c_main_~main__index1~0 (+ .cse0 .cse1)) (let ((.cse8 (+ (* 17179869184 .cse11) .cse12))) (and (or (let ((.cse6 (select |c_#memory_int| |c_main_~#main__array~0.base|))) (let ((.cse4 (select .cse6 (- .cse7)))) (<= .cse4 (let ((.cse5 (select .cse6 (+ |c_main_~#main__array~0.offset| (* 4 .cse1))))) (+ .cse5 (* 4294967296 (div (+ .cse4 (- .cse5)) 4294967296))))))) (<= .cse8 (+ .cse9 .cse10 3))) (<= .cse8 (+ .cse9 .cse10 4))))) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867294) 4294967296)) 2) c_main_~main__index1~0)))))) is different from false [2018-10-26 22:21:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-26 22:21:54,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:21:54,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:21:54,517 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 22:21:54,518 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [50], [58], [61], [65], [68], [69], [106], [107], [108] [2018-10-26 22:21:54,557 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:21:54,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:21:54,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 22:21:55,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:21:55,269 INFO L272 AbstractInterpreter]: Visited 25 different actions 27 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 46 variables. [2018-10-26 22:21:55,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:21:55,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:21:55,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:21:55,298 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:21:55,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:21:55,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:21:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:55,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:22:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:14,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:22:14,404 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-10-26 22:22:19,484 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:22:19,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:19,496 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:22:19,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:19,498 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:22:19,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:19,505 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 99 treesize of output 91 [2018-10-26 22:22:19,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,516 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,519 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,525 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,527 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 138 [2018-10-26 22:22:19,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 22:22:19,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:19,707 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 78 treesize of output 70 [2018-10-26 22:22:19,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,723 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,740 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 126 [2018-10-26 22:22:19,760 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 22:22:19,786 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:19,864 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 84 treesize of output 76 [2018-10-26 22:22:19,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,932 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,941 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:19,981 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,129 INFO L303 Elim1Store]: Index analysis took 263 ms [2018-10-26 22:22:20,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 127 [2018-10-26 22:22:20,153 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 22:22:20,214 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:20,217 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 91 treesize of output 83 [2018-10-26 22:22:20,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,222 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,229 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,231 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 135 [2018-10-26 22:22:20,269 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-26 22:22:20,429 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:20,445 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 87 treesize of output 79 [2018-10-26 22:22:20,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,467 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:22:20,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 129 [2018-10-26 22:22:20,481 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-26 22:22:20,498 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:22:20,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 22:22:20,526 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 9 variables, input treesize:1149, output treesize:74 [2018-10-26 22:22:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:22:20,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 8] imperfect sequences [14] total 28 [2018-10-26 22:22:20,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:22:20,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:22:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:22:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=493, Unknown=17, NotChecked=98, Total=756 [2018-10-26 22:22:20,687 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 11 states. [2018-10-26 22:22:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:22:35,088 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-10-26 22:22:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:22:35,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-10-26 22:22:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:22:35,089 INFO L225 Difference]: With dead ends: 48 [2018-10-26 22:22:35,089 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:22:35,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 147.0s TimeCoverageRelationStatistics Valid=288, Invalid=889, Unknown=21, NotChecked=134, Total=1332 [2018-10-26 22:22:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:22:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:22:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:22:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:22:35,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-10-26 22:22:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:22:35,090 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:22:35,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:22:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:22:35,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:22:35,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:22:51,783 WARN L179 SmtUtils]: Spent 16.62 s on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-10-26 22:23:12,274 WARN L179 SmtUtils]: Spent 20.49 s on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2018-10-26 22:23:12,401 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 22:23:12,402 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L428 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-10-26 22:23:12,402 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L421 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (or (let ((.cse7 (div (+ main_~main__index2~0 4294867297) 4294967296))) (let ((.cse0 (+ (* 34359738368 .cse7) (* 4 main_~main__index1~0))) (.cse1 (* 17179869184 (div (+ main_~main__index1~0 (- 1)) 4294967296))) (.cse2 (* 4 main_~main__index2~0)) (.cse3 (* 17179869184 (div (+ main_~main__index2~0 1) 4294967296)))) (or (<= .cse0 (+ .cse1 .cse2 .cse3)) (and (<= .cse0 (+ .cse1 .cse2 .cse3 4)) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse6 (- (+ (- |main_~#main__array~0.offset|) (+ (* 17179869184 .cse7) (+ (* (- 4) main_~main__index2~0) (- 4)))))))) (<= .cse4 (let ((.cse5 (select .cse6 (+ |main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse7) main_~main__index2~0)))))) (+ .cse5 (* 4294967296 (div (+ .cse4 (- .cse5)) 4294967296))))))))))) (let ((.cse8 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse8 99999)) (<= (+ main_~main__index1~0 .cse8 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))))) [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-10-26 22:23:12,403 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse2 (mod (+ main_~main__index1~0 4294967295) 4294967296)) (.cse1 (mod (+ main_~main__index2~0 1) 4294967296))) (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (let ((.cse0 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse0 (+ |main_~#main__array~0.offset| (* 4 .cse1))) 4294967296) (mod (select .cse0 (+ (* 4 .cse2) |main_~#main__array~0.offset|)) 4294967296))) (< .cse2 .cse1) (< .cse1 100000))) [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (mod main_~main__index2~0 4294967296))) (or (let ((.cse4 (mod (+ main_~main__index1~0 4294967295) 4294967296)) (.cse3 (mod (+ main_~main__index2~0 1) 4294967296))) (and (< (mod main_~main__index1~0 4294967296) .cse0) .cse1 (let ((.cse2 (select |#memory_int| |main_~#main__array~0.base|))) (= (mod (select .cse2 (+ |main_~#main__array~0.offset| (* 4 .cse3))) 4294967296) (mod (select .cse2 (+ (* 4 .cse4) |main_~#main__array~0.offset|)) 4294967296))) (< .cse4 .cse3) (not (= 0 main_~__VERIFIER_assert__cond~1)) (< .cse3 100000))) (and (= main_~main____CPAchecker_TMP_0~0 1) .cse1 (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (< .cse0 100000)))) [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-10-26 22:23:12,404 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-10-26 22:23:12,404 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (and (= main_~main____CPAchecker_TMP_0~0 1) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (< (mod main_~main__index2~0 4294967296) 100000)) [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-10-26 22:23:12,405 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-10-26 22:23:12,406 INFO L421 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (let ((.cse0 (* 4 main_~main__index1~0)) (.cse1 (* 4 main_~main__index2~0))) (and (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= (+ (* 34359738368 (div (+ main_~main__index2~0 4294867297) 4294967296)) .cse0) (+ (* 17179869184 (div (+ main_~main__index1~0 (- 1)) 4294967296)) .cse1 (* 17179869184 (div (+ main_~main__index2~0 1) 4294967296)) 4)) (let ((.cse5 (div main_~main__index2~0 4294967296))) (let ((.cse6 (+ (* 17179869184 .cse5) (+ (- |main_~#main__array~0.offset|) (+ (* (- 4) main_~main__index2~0) (- 4)))))) (or (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (- .cse6)))) (<= .cse2 (let ((.cse3 (select .cse4 (+ |main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse5) main_~main__index2~0)))))) (+ (* 4294967296 (div (+ .cse2 (- .cse3)) 4294967296)) .cse3))))) (<= (+ (div (+ (* (- 17179869184) (div main_~main__index1~0 4294967296)) (+ (* (- 17179869184) .cse5) (+ |main_~#main__array~0.offset| (+ .cse0 (+ .cse1 (+ .cse6 3)))))) 4) (* 4294967296 .cse5) 1) main_~main__index2~0)))))) [2018-10-26 22:23:12,406 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-10-26 22:23:12,406 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-10-26 22:23:12,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,437 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,444 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:23:12 BoogieIcfgContainer [2018-10-26 22:23:12,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:23:12,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:23:12,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:23:12,460 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:23:12,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:18:47" (3/4) ... [2018-10-26 22:23:12,474 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 22:23:12,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 22:23:12,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 22:23:12,492 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2018-10-26 22:23:12,493 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-10-26 22:23:12,493 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-10-26 22:23:12,583 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bf6ece15-4227-4913-82df-1de6d46c514a/bin-2019/utaipan/witness.graphml [2018-10-26 22:23:12,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:23:12,584 INFO L168 Benchmark]: Toolchain (without parser) took 266128.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:12,585 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:23:12,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 941.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:12,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.49 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:23:12,586 INFO L168 Benchmark]: Boogie Preprocessor took 23.61 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:23:12,586 INFO L168 Benchmark]: RCFGBuilder took 668.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:12,586 INFO L168 Benchmark]: TraceAbstraction took 265042.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:12,587 INFO L168 Benchmark]: Witness Printer took 135.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:12,591 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 216.88 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 941.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.49 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. * Boogie Preprocessor took 23.61 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 668.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 265042.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Witness Printer took 135.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. 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 - 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: 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 - PositiveResult [Line: 68]: 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 [2018-10-26 22:23:12,594 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,594 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (!(0 == __VERIFIER_assert__cond) && 34359738368 * ((main__index2 + 4294867297) / 4294967296) + 4 * main__index1 <= 17179869184 * ((main__index1 + -1) / 4294967296) + 4 * main__index2 + 17179869184 * ((main__index2 + 1) / 4294967296) + 4) && (unknown-#memory_int-unknown[main__array][-(17179869184 * (main__index2 / 4294967296) + (-main__array + (-4 * main__index2 + -4)))] <= 4294967296 * ((unknown-#memory_int-unknown[main__array][-(17179869184 * (main__index2 / 4294967296) + (-main__array + (-4 * main__index2 + -4)))] + -unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + main__index2)]) / 4294967296) + unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + main__index2)] || (-17179869184 * (main__index1 / 4294967296) + (-17179869184 * (main__index2 / 4294967296) + (main__array + (4 * main__index1 + (4 * main__index2 + (17179869184 * (main__index2 / 4294967296) + (-main__array + (-4 * main__index2 + -4)) + 3)))))) / 4 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-10-26 22:23:12,610 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,611 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (34359738368 * ((main__index2 + 4294867297) / 4294967296) + 4 * main__index1 <= 17179869184 * ((main__index1 + -1) / 4294967296) + 4 * main__index2 + 17179869184 * ((main__index2 + 1) / 4294967296) || (34359738368 * ((main__index2 + 4294867297) / 4294967296) + 4 * main__index1 <= 17179869184 * ((main__index1 + -1) / 4294967296) + 4 * main__index2 + 17179869184 * ((main__index2 + 1) / 4294967296) + 4 && unknown-#memory_int-unknown[main__array][-(-main__array + (17179869184 * ((main__index2 + 4294867297) / 4294967296) + (-4 * main__index2 + -4)))] <= unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * ((main__index2 + 4294867297) / 4294967296) + main__index2)] + 4294967296 * ((unknown-#memory_int-unknown[main__array][-(-main__array + (17179869184 * ((main__index2 + 4294867297) / 4294967296) + (-4 * main__index2 + -4)))] + -unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * ((main__index2 + 4294867297) / 4294967296) + main__index2)]) / 4294967296))) || ((!(0 == __VERIFIER_assert__cond) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant [2018-10-26 22:23:12,613 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,613 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,613 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,613 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && unknown-#memory_int-unknown[main__array][main__array + 4 * ((main__index2 + 1) % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][4 * ((main__index1 + 4294967295) % 4294967296) + main__array] % 4294967296) && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main____CPAchecker_TMP_0 == 1 && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main__index2 % 4294967296 < 100000 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant [2018-10-26 22:23:12,614 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,615 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,615 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:23:12,615 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[main__array][main__array + 4 * ((main__index2 + 1) % 4294967296)] % 4294967296 == unknown-#memory_int-unknown[main__array][4 * ((main__index1 + 4294967295) % 4294967296) + main__array] % 4294967296) && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && !(0 == __VERIFIER_assert__cond)) && (main__index2 + 1) % 4294967296 < 100000) || (((main____CPAchecker_TMP_0 == 1 && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main__index2 % 4294967296 < 100000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 264.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 75.7s AutomataDifference, 0.0s DeadEndRemovalTime, 37.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 298 SDslu, 434 SDs, 0 SdLazy, 306 SolverSat, 44 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 211.4s 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.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 77 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 533 HoareAnnotationTreeSize, 12 FomulaSimplifications, 213 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 320 FormulaSimplificationTreeSizeReductionInter, 37.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 150.5s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 84759 SizeOfPredicates, 21 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 8/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...