./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/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 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:13:43,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:13:43,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:13:43,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:13:43,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:13:43,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:13:43,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:13:43,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:13:43,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:13:43,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:13:43,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:13:43,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:13:43,159 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:13:43,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:13:43,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:13:43,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:13:43,161 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:13:43,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:13:43,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:13:43,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:13:43,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:13:43,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:13:43,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:13:43,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:13:43,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:13:43,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:13:43,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:13:43,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:13:43,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:13:43,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:13:43,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:13:43,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:13:43,169 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:13:43,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:13:43,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:13:43,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:13:43,170 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 15:13:43,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:13:43,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:13:43,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:13:43,178 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:13:43,178 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:13:43,178 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:13:43,178 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:13:43,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:13:43,179 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:13:43,179 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:13:43,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:13:43,179 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:13:43,179 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:13:43,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:13:43,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:13:43,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:13:43,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:13:43,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:13:43,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 15:13:43,182 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_465d68be-1543-4d31-980d-84ffcf25455d/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 -> 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 [2018-12-02 15:13:43,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:13:43,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:13:43,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:13:43,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:13:43,210 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:13:43,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-12-02 15:13:43,249 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/data/cb8c9bcee/4f3d6fd950f641ad81eb53d0ec2dc1a2/FLAG314e783ff [2018-12-02 15:13:43,666 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:13:43,666 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/sv-benchmarks/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-12-02 15:13:43,673 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/data/cb8c9bcee/4f3d6fd950f641ad81eb53d0ec2dc1a2/FLAG314e783ff [2018-12-02 15:13:43,682 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/data/cb8c9bcee/4f3d6fd950f641ad81eb53d0ec2dc1a2 [2018-12-02 15:13:43,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:13:43,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:13:43,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:13:43,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:13:43,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:13:43,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:43,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f79c046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43, skipping insertion in model container [2018-12-02 15:13:43,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:43,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:13:43,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:13:43,893 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:13:43,897 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:13:43,983 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:13:43,993 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:13:43,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43 WrapperNode [2018-12-02 15:13:43,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:13:43,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:13:43,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:13:43,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:13:43,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:13:44,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:13:44,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:13:44,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:13:44,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... [2018-12-02 15:13:44,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:13:44,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:13:44,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:13:44,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:13:44,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:13:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:13:44,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:13:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 15:13:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 15:13:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:13:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:13:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:13:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:13:44,670 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:13:44,670 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 15:13:44,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:44 BoogieIcfgContainer [2018-12-02 15:13:44,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:13:44,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:13:44,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:13:44,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:13:44,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:13:43" (1/3) ... [2018-12-02 15:13:44,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b209e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:13:44, skipping insertion in model container [2018-12-02 15:13:44,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:43" (2/3) ... [2018-12-02 15:13:44,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b209e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:13:44, skipping insertion in model container [2018-12-02 15:13:44,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:44" (3/3) ... [2018-12-02 15:13:44,675 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-12-02 15:13:44,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:13:44,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 15:13:44,696 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 15:13:44,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:13:44,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 15:13:44,716 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:13:44,716 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:13:44,716 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:13:44,716 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:13:44,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:13:44,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:13:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-02 15:13:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 15:13:44,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:44,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:44,738 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:44,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash 700982975, now seen corresponding path program 1 times [2018-12-02 15:13:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:44,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:44,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:44,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:13:44,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:13:44,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:44,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:13:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:13:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:13:45,001 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-12-02 15:13:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:45,429 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-02 15:13:45,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:13:45,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-02 15:13:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:45,438 INFO L225 Difference]: With dead ends: 547 [2018-12-02 15:13:45,439 INFO L226 Difference]: Without dead ends: 278 [2018-12-02 15:13:45,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:13:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-02 15:13:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-02 15:13:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 15:13:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2018-12-02 15:13:45,476 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 123 [2018-12-02 15:13:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:45,476 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2018-12-02 15:13:45,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:13:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2018-12-02 15:13:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 15:13:45,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:45,481 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:45,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:45,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash 538208968, now seen corresponding path program 1 times [2018-12-02 15:13:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:45,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:45,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:45,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:13:45,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:13:45,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:45,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:13:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:13:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:13:45,568 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2018-12-02 15:13:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:45,939 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2018-12-02 15:13:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:13:45,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-12-02 15:13:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:45,942 INFO L225 Difference]: With dead ends: 840 [2018-12-02 15:13:45,942 INFO L226 Difference]: Without dead ends: 568 [2018-12-02 15:13:45,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:13:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-02 15:13:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2018-12-02 15:13:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-02 15:13:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2018-12-02 15:13:45,964 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 133 [2018-12-02 15:13:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:45,964 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2018-12-02 15:13:45,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:13:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2018-12-02 15:13:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-02 15:13:45,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:45,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:45,966 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:45,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 129203270, now seen corresponding path program 1 times [2018-12-02 15:13:45,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:45,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:45,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:45,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:46,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:13:46,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:13:46,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:13:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:13:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:13:46,114 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 5 states. [2018-12-02 15:13:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:46,430 INFO L93 Difference]: Finished difference Result 1205 states and 1730 transitions. [2018-12-02 15:13:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:13:46,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-12-02 15:13:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:46,432 INFO L225 Difference]: With dead ends: 1205 [2018-12-02 15:13:46,432 INFO L226 Difference]: Without dead ends: 554 [2018-12-02 15:13:46,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:13:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-02 15:13:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-12-02 15:13:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-12-02 15:13:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2018-12-02 15:13:46,444 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 134 [2018-12-02 15:13:46,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:46,444 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2018-12-02 15:13:46,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:13:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2018-12-02 15:13:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-02 15:13:46,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:46,446 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:46,446 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:46,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1311022732, now seen corresponding path program 1 times [2018-12-02 15:13:46,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:46,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:46,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:46,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:13:46,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:13:46,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:46,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:13:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:13:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:13:46,615 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand 5 states. [2018-12-02 15:13:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:46,932 INFO L93 Difference]: Finished difference Result 1184 states and 1552 transitions. [2018-12-02 15:13:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:13:46,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2018-12-02 15:13:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:46,935 INFO L225 Difference]: With dead ends: 1184 [2018-12-02 15:13:46,936 INFO L226 Difference]: Without dead ends: 554 [2018-12-02 15:13:46,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:13:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-12-02 15:13:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-12-02 15:13:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-12-02 15:13:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 708 transitions. [2018-12-02 15:13:46,955 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 708 transitions. Word has length 135 [2018-12-02 15:13:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:46,955 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 708 transitions. [2018-12-02 15:13:46,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:13:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 708 transitions. [2018-12-02 15:13:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 15:13:46,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:46,957 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:46,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:46,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash -663161394, now seen corresponding path program 1 times [2018-12-02 15:13:46,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:46,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:46,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:47,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:13:47,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:13:47,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:47,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:13:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:13:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:13:47,038 INFO L87 Difference]: Start difference. First operand 554 states and 708 transitions. Second operand 3 states. [2018-12-02 15:13:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:47,272 INFO L93 Difference]: Finished difference Result 1509 states and 1954 transitions. [2018-12-02 15:13:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:13:47,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-12-02 15:13:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:47,276 INFO L225 Difference]: With dead ends: 1509 [2018-12-02 15:13:47,276 INFO L226 Difference]: Without dead ends: 961 [2018-12-02 15:13:47,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:13:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-02 15:13:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-02 15:13:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-02 15:13:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1180 transitions. [2018-12-02 15:13:47,298 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1180 transitions. Word has length 138 [2018-12-02 15:13:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:47,299 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1180 transitions. [2018-12-02 15:13:47,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:13:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1180 transitions. [2018-12-02 15:13:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-02 15:13:47,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:47,302 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:47,302 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:47,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1614473983, now seen corresponding path program 1 times [2018-12-02 15:13:47,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:47,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:47,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:47,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:47,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:13:47,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-12-02 15:13:47,392 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 15:13:47,420 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:13:47,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:13:47,661 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 15:13:47,662 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Performed 1630 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1630 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-02 15:13:47,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:47,678 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 15:13:47,936 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 80.48% of their original sizes. [2018-12-02 15:13:47,936 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 15:13:47,963 INFO L418 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2018-12-02 15:13:47,963 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 15:13:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:13:47,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-02 15:13:47,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:47,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:13:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:13:47,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:13:47,965 INFO L87 Difference]: Start difference. First operand 959 states and 1180 transitions. Second operand 6 states. [2018-12-02 15:13:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:49,362 INFO L93 Difference]: Finished difference Result 2048 states and 2511 transitions. [2018-12-02 15:13:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:13:49,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2018-12-02 15:13:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:49,364 INFO L225 Difference]: With dead ends: 2048 [2018-12-02 15:13:49,365 INFO L226 Difference]: Without dead ends: 1095 [2018-12-02 15:13:49,366 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:13:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-12-02 15:13:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1094. [2018-12-02 15:13:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-12-02 15:13:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1321 transitions. [2018-12-02 15:13:49,380 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1321 transitions. Word has length 169 [2018-12-02 15:13:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:49,380 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1321 transitions. [2018-12-02 15:13:49,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:13:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1321 transitions. [2018-12-02 15:13:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 15:13:49,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:49,383 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:49,383 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:49,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1277531516, now seen corresponding path program 1 times [2018-12-02 15:13:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:49,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:49,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:13:49,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:49,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:13:49,445 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-12-02 15:13:49,445 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 15:13:49,448 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:13:49,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:13:49,619 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 15:13:49,619 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 4 different actions 4 times. Never widened. Performed 3258 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-02 15:13:49,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:49,620 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 15:13:49,784 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 81.92% of their original sizes. [2018-12-02 15:13:49,784 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 15:13:49,822 INFO L418 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-12-02 15:13:49,822 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 15:13:49,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:13:49,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 15:13:49,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:49,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 15:13:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:13:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:13:49,823 INFO L87 Difference]: Start difference. First operand 1094 states and 1321 transitions. Second operand 10 states. [2018-12-02 15:13:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:51,850 INFO L93 Difference]: Finished difference Result 2186 states and 2669 transitions. [2018-12-02 15:13:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:13:51,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2018-12-02 15:13:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:51,854 INFO L225 Difference]: With dead ends: 2186 [2018-12-02 15:13:51,854 INFO L226 Difference]: Without dead ends: 1233 [2018-12-02 15:13:51,856 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 15:13:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-02 15:13:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1231. [2018-12-02 15:13:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-12-02 15:13:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1468 transitions. [2018-12-02 15:13:51,881 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1468 transitions. Word has length 177 [2018-12-02 15:13:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:51,882 INFO L480 AbstractCegarLoop]: Abstraction has 1231 states and 1468 transitions. [2018-12-02 15:13:51,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 15:13:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1468 transitions. [2018-12-02 15:13:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 15:13:51,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:51,885 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:51,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:51,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash -618245438, now seen corresponding path program 1 times [2018-12-02 15:13:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:51,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:51,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 15:13:51,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:51,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:13:51,973 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-12-02 15:13:51,973 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 15:13:51,975 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:13:51,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:13:52,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 15:13:52,089 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 4 different actions 4 times. Never widened. Performed 3329 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3329 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-02 15:13:52,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:52,090 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 15:13:52,277 INFO L227 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 81.86% of their original sizes. [2018-12-02 15:13:52,278 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 15:13:52,339 INFO L418 sIntCurrentIteration]: We unified 209 AI predicates to 209 [2018-12-02 15:13:52,339 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 15:13:52,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:13:52,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 15:13:52,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:52,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 15:13:52,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:13:52,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:13:52,340 INFO L87 Difference]: Start difference. First operand 1231 states and 1468 transitions. Second operand 10 states. [2018-12-02 15:13:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:54,345 INFO L93 Difference]: Finished difference Result 2460 states and 2957 transitions. [2018-12-02 15:13:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 15:13:54,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-12-02 15:13:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:54,348 INFO L225 Difference]: With dead ends: 2460 [2018-12-02 15:13:54,348 INFO L226 Difference]: Without dead ends: 1507 [2018-12-02 15:13:54,349 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:13:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-12-02 15:13:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1505. [2018-12-02 15:13:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2018-12-02 15:13:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1763 transitions. [2018-12-02 15:13:54,368 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1763 transitions. Word has length 210 [2018-12-02 15:13:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:54,368 INFO L480 AbstractCegarLoop]: Abstraction has 1505 states and 1763 transitions. [2018-12-02 15:13:54,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 15:13:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1763 transitions. [2018-12-02 15:13:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 15:13:54,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:54,371 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:54,371 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:54,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash -212448035, now seen corresponding path program 1 times [2018-12-02 15:13:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:54,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:54,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 51 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 15:13:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:54,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:13:54,450 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-12-02 15:13:54,451 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [629], [631], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 15:13:54,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:13:54,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:13:54,757 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:13:54,757 INFO L272 AbstractInterpreter]: Visited 130 different actions 521 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 7294 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7294 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 15:13:54,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:54,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:13:54,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:54,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:13:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:54,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:13:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:54,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:13:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 15:13:54,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:13:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 97 proven. 44 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 15:13:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:13:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 15:13:55,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:13:55,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:13:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:13:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:13:55,030 INFO L87 Difference]: Start difference. First operand 1505 states and 1763 transitions. Second operand 11 states. [2018-12-02 15:13:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:55,739 INFO L93 Difference]: Finished difference Result 3169 states and 3791 transitions. [2018-12-02 15:13:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:13:55,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 218 [2018-12-02 15:13:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:55,744 INFO L225 Difference]: With dead ends: 3169 [2018-12-02 15:13:55,744 INFO L226 Difference]: Without dead ends: 2079 [2018-12-02 15:13:55,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-02 15:13:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2018-12-02 15:13:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1801. [2018-12-02 15:13:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-12-02 15:13:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2078 transitions. [2018-12-02 15:13:55,771 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2078 transitions. Word has length 218 [2018-12-02 15:13:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:55,771 INFO L480 AbstractCegarLoop]: Abstraction has 1801 states and 2078 transitions. [2018-12-02 15:13:55,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:13:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2078 transitions. [2018-12-02 15:13:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 15:13:55,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:13:55,774 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:13:55,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:13:55,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:13:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1936761017, now seen corresponding path program 2 times [2018-12-02 15:13:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:13:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:13:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:13:55,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:13:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 53 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-02 15:13:55,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:55,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:13:55,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 15:13:55,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 15:13:55,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:13:55,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:13:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:13:55,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 15:13:55,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 15:13:55,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:13:55,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:13:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 15:13:55,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:13:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-02 15:13:56,058 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:13:56,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-02 15:13:56,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:13:56,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:13:56,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:13:56,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:13:56,059 INFO L87 Difference]: Start difference. First operand 1801 states and 2078 transitions. Second operand 3 states. [2018-12-02 15:13:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:13:56,302 INFO L93 Difference]: Finished difference Result 4146 states and 4907 transitions. [2018-12-02 15:13:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:13:56,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-12-02 15:13:56,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:13:56,303 INFO L225 Difference]: With dead ends: 4146 [2018-12-02 15:13:56,303 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:13:56,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:13:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:13:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:13:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:13:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:13:56,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2018-12-02 15:13:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:13:56,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:13:56,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:13:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:13:56,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:13:56,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 15:13:56,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 15:13:56,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 15:13:56,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 15:13:56,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 15:13:56,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 15:13:56,954 WARN L180 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 91 [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,046 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-02 15:13:57,047 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-02 15:13:57,048 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,049 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-02 15:13:57,050 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,051 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse23 (= |old(~a20~0)| ~a20~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse20 (= 13 |old(~a8~0)|))) (let ((.cse15 (not (= 5 |old(~a16~0)|))) (.cse13 (= ~a17~0 1)) (.cse3 (not (= 4 |old(~a16~0)|))) (.cse5 (= 13 ~a8~0)) (.cse6 (= 1 ~a21~0)) (.cse7 (= 1 ~a17~0)) (.cse1 (= 1 |old(~a7~0)|)) (.cse8 (not .cse20)) (.cse9 (not (= 1 |old(~a17~0)|))) (.cse10 (and .cse23 .cse24)) (.cse12 (= |calculate_output_#in~input| 0)) (.cse17 (= ~a8~0 15)) (.cse18 (= ~a21~0 1)) (.cse16 (= ~a7~0 0)) (.cse21 (= 6 |old(~a16~0)|)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 1 |old(~a20~0)|))) (.cse14 (not (= 15 |old(~a8~0)|))) (.cse19 (not (= ~a8~0 13))) (.cse4 (not (= 8 ~a12~0))) (.cse22 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (not (= ~a7~0 1)) .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse10 (or .cse2 .cse4)) (or .cse11 .cse0 .cse4 .cse12 .cse9 .cse13 .cse2 .cse14 .cse15) (or (or .cse11 .cse0 .cse14 (not (= 0 |old(~a20~0)|)) .cse15 .cse4) .cse12 (and .cse16 .cse17 .cse13 .cse18) .cse9) (or .cse0 .cse2 .cse3 (and (= 1 ~a7~0) .cse5 .cse6 .cse7) .cse4 (not .cse1) .cse8 .cse9) (or .cse19 (or .cse2 .cse20 .cse4)) (or .cse21 .cse11 .cse0 .cse2 .cse14 (= 0 |old(~a16~0)|) .cse4 .cse12 (and .cse17 .cse18 .cse16)) (or (< 4 |old(~a16~0)|) .cse10 .cse4 .cse22) (or .cse12 (and .cse17 .cse18 (= ~a17~0 0) .cse16) (or (not .cse21) .cse11 .cse0 .cse2 .cse14 (not (= 0 |old(~a17~0)|)) .cse4)) (or (and .cse23 .cse24 .cse19) .cse20 .cse4 .cse22)))) [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-02 15:13:57,052 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-02 15:13:57,053 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-02 15:13:57,054 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 15:13:57,055 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-12-02 15:13:57,055 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 15:13:57,055 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 15:13:57,055 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a8~0 15) (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-12-02 15:13:57,055 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-02 15:13:57,055 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-12-02 15:13:57,055 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-02 15:13:57,055 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-02 15:13:57,055 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (and .cse0 (not (= ~a8~0 13))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse0 (<= ~a16~0 4)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-12-02 15:13:57,055 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-02 15:13:57,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:13:57 BoogieIcfgContainer [2018-12-02 15:13:57,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:13:57,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:13:57,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:13:57,064 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:13:57,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:44" (3/4) ... [2018-12-02 15:13:57,067 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:13:57,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:13:57,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 15:13:57,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:13:57,080 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 15:13:57,080 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 15:13:57,100 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) [2018-12-02 15:13:57,162 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_465d68be-1543-4d31-980d-84ffcf25455d/bin-2019/utaipan/witness.graphml [2018-12-02 15:13:57,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:13:57,163 INFO L168 Benchmark]: Toolchain (without parser) took 13479.42 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.5 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -240.8 MB). Peak memory consumption was 374.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,164 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:13:57,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,165 INFO L168 Benchmark]: Boogie Preprocessor took 39.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,165 INFO L168 Benchmark]: RCFGBuilder took 618.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.0 MB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,165 INFO L168 Benchmark]: TraceAbstraction took 12392.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 502.8 MB). Free memory was 982.3 MB in the beginning and 1.2 GB in the end (delta: -213.5 MB). Peak memory consumption was 289.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,166 INFO L168 Benchmark]: Witness Printer took 98.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:13:57,167 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 618.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.0 MB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12392.67 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 502.8 MB). Free memory was 982.3 MB in the beginning and 1.2 GB in the end (delta: -213.5 MB). Peak memory consumption was 289.3 MB. Max. memory is 11.5 GB. * Witness Printer took 98.62 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a20 <= 0 && !(a8 == 13)) || !(0 == \old(a7))) || !(1 == \old(a21))) || !(8 == a12)) || (a20 <= 0 && a16 <= 4)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 12.3s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 562 SDtfs, 4309 SDslu, 325 SDs, 0 SdLazy, 5303 SolverSat, 731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1507 GetRequests, 1417 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1801occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9974080033564772 AbsIntWeakeningRatio, 0.2115732368896926 AbsIntAvgWeakeningVarsNumRemoved, 29.690777576853527 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 297 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 82 PreInvPairs, 124 NumberOfFragments, 501 HoareAnnotationTreeSize, 82 FomulaSimplifications, 2025 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1329 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2091 NumberOfCodeBlocks, 2027 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2513 ConstructedInterpolants, 0 QuantifiedInterpolants, 1504061 SizeOfPredicates, 3 NumberOfNonLiveVariables, 985 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1132/1314 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...