./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label30_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_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/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 cc1563f4697cf21aca476a1aac04fcd8ee81163f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:21:55,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:21:55,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:21:55,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:21:55,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:21:55,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:21:55,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:21:55,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:21:55,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:21:55,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:21:55,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:21:55,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:21:55,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:21:55,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:21:55,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:21:55,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:21:55,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:21:55,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:21:55,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:21:55,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:21:55,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:21:55,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:21:55,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:21:55,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:21:55,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:21:55,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:21:55,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:21:55,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:21:55,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:21:55,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:21:55,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:21:55,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:21:55,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:21:55,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:21:55,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:21:55,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:21:55,145 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:21:55,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:21:55,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:21:55,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:21:55,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:21:55,153 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:21:55,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:21:55,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:21:55,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:21:55,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:21:55,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:21:55,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:21:55,156 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:21:55,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:21:55,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:21:55,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:21:55,156 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_b616a1bb-3342-4df7-917a-7a778634a122/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 -> cc1563f4697cf21aca476a1aac04fcd8ee81163f [2018-12-02 20:21:55,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:21:55,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:21:55,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:21:55,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:21:55,186 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:21:55,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-12-02 20:21:55,230 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/data/10caed65f/43d0e243ab444f11b67626588e24271b/FLAG9dc415e8e [2018-12-02 20:21:55,578 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:21:55,578 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/sv-benchmarks/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-12-02 20:21:55,585 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/data/10caed65f/43d0e243ab444f11b67626588e24271b/FLAG9dc415e8e [2018-12-02 20:21:55,593 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/data/10caed65f/43d0e243ab444f11b67626588e24271b [2018-12-02 20:21:55,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:21:55,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:21:55,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:21:55,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:21:55,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:21:55,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55, skipping insertion in model container [2018-12-02 20:21:55,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:21:55,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:21:55,797 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:21:55,800 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:21:55,891 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:21:55,900 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:21:55,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55 WrapperNode [2018-12-02 20:21:55,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:21:55,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:21:55,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:21:55,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:21:55,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:21:55,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:21:55,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:21:55,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:21:55,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... [2018-12-02 20:21:55,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:21:55,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:21:55,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:21:55,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:21:55,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/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 20:21:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:21:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:21:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 20:21:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 20:21:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:21:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:21:55,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:21:55,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:21:56,506 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:21:56,506 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 20:21:56,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:56 BoogieIcfgContainer [2018-12-02 20:21:56,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:21:56,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:21:56,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:21:56,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:21:56,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:21:55" (1/3) ... [2018-12-02 20:21:56,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:56, skipping insertion in model container [2018-12-02 20:21:56,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:21:55" (2/3) ... [2018-12-02 20:21:56,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d43cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:21:56, skipping insertion in model container [2018-12-02 20:21:56,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:56" (3/3) ... [2018-12-02 20:21:56,511 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-12-02 20:21:56,518 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:21:56,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:21:56,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:21:56,553 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:21:56,554 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:21:56,554 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:21:56,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:21:56,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:21:56,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:21:56,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:21:56,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:21:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-02 20:21:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 20:21:56,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:56,574 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:21:56,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:56,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -152148385, now seen corresponding path program 1 times [2018-12-02 20:21:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:56,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:56,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:56,855 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 20:21:56,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:21:56,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:21:56,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:56,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:21:56,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:21:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:21:56,870 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-12-02 20:21:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:21:57,472 INFO L93 Difference]: Finished difference Result 698 states and 1223 transitions. [2018-12-02 20:21:57,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:21:57,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-02 20:21:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:21:57,485 INFO L225 Difference]: With dead ends: 698 [2018-12-02 20:21:57,485 INFO L226 Difference]: Without dead ends: 413 [2018-12-02 20:21:57,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:21:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-02 20:21:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 278. [2018-12-02 20:21:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-02 20:21:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 406 transitions. [2018-12-02 20:21:57,534 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 406 transitions. Word has length 131 [2018-12-02 20:21:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:21:57,534 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 406 transitions. [2018-12-02 20:21:57,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:21:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 406 transitions. [2018-12-02 20:21:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 20:21:57,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:57,537 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:21:57,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:57,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1159631208, now seen corresponding path program 1 times [2018-12-02 20:21:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:57,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:57,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:57,605 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 20:21:57,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:21:57,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:21:57,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:21:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:21:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:21:57,607 INFO L87 Difference]: Start difference. First operand 278 states and 406 transitions. Second operand 6 states. [2018-12-02 20:21:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:21:57,968 INFO L93 Difference]: Finished difference Result 703 states and 1045 transitions. [2018-12-02 20:21:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:21:57,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-12-02 20:21:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:21:57,971 INFO L225 Difference]: With dead ends: 703 [2018-12-02 20:21:57,971 INFO L226 Difference]: Without dead ends: 431 [2018-12-02 20:21:57,972 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 20:21:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-02 20:21:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2018-12-02 20:21:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 20:21:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 597 transitions. [2018-12-02 20:21:57,985 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 597 transitions. Word has length 141 [2018-12-02 20:21:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:21:57,985 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 597 transitions. [2018-12-02 20:21:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:21:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 597 transitions. [2018-12-02 20:21:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 20:21:57,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:57,987 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:21:57,988 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:57,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1563736858, now seen corresponding path program 1 times [2018-12-02 20:21:57,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:57,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:57,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:57,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:57,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:58,135 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 20:21:58,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:21:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:21:58,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:58,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:21:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:21:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:21:58,136 INFO L87 Difference]: Start difference. First operand 417 states and 597 transitions. Second operand 5 states. [2018-12-02 20:21:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:21:58,453 INFO L93 Difference]: Finished difference Result 927 states and 1352 transitions. [2018-12-02 20:21:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:21:58,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-12-02 20:21:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:21:58,455 INFO L225 Difference]: With dead ends: 927 [2018-12-02 20:21:58,456 INFO L226 Difference]: Without dead ends: 415 [2018-12-02 20:21:58,456 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 20:21:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-02 20:21:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-12-02 20:21:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-02 20:21:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 545 transitions. [2018-12-02 20:21:58,466 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 545 transitions. Word has length 142 [2018-12-02 20:21:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:21:58,467 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 545 transitions. [2018-12-02 20:21:58,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:21:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 545 transitions. [2018-12-02 20:21:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 20:21:58,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:58,468 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:21:58,468 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:58,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash -77416850, now seen corresponding path program 1 times [2018-12-02 20:21:58,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:58,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:58,538 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 20:21:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:21:58,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:21:58,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:58,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:21:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:21:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:21:58,539 INFO L87 Difference]: Start difference. First operand 415 states and 545 transitions. Second operand 3 states. [2018-12-02 20:21:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:21:58,813 INFO L93 Difference]: Finished difference Result 1231 states and 1647 transitions. [2018-12-02 20:21:58,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:21:58,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-12-02 20:21:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:21:58,816 INFO L225 Difference]: With dead ends: 1231 [2018-12-02 20:21:58,817 INFO L226 Difference]: Without dead ends: 822 [2018-12-02 20:21:58,818 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 20:21:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-12-02 20:21:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2018-12-02 20:21:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-12-02 20:21:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1060 transitions. [2018-12-02 20:21:58,841 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1060 transitions. Word has length 146 [2018-12-02 20:21:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:21:58,841 INFO L480 AbstractCegarLoop]: Abstraction has 822 states and 1060 transitions. [2018-12-02 20:21:58,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:21:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1060 transitions. [2018-12-02 20:21:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 20:21:58,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:58,844 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:21:58,844 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:58,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1784447858, now seen corresponding path program 1 times [2018-12-02 20:21:58,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:58,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:21:58,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:21:58,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:21:58,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:58,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:21:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:21:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:21:58,900 INFO L87 Difference]: Start difference. First operand 822 states and 1060 transitions. Second operand 6 states. [2018-12-02 20:21:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:21:59,257 INFO L93 Difference]: Finished difference Result 2083 states and 2796 transitions. [2018-12-02 20:21:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:21:59,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-12-02 20:21:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:21:59,261 INFO L225 Difference]: With dead ends: 2083 [2018-12-02 20:21:59,261 INFO L226 Difference]: Without dead ends: 1267 [2018-12-02 20:21:59,262 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 20:21:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2018-12-02 20:21:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1112. [2018-12-02 20:21:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-12-02 20:21:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1401 transitions. [2018-12-02 20:21:59,285 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1401 transitions. Word has length 162 [2018-12-02 20:21:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:21:59,285 INFO L480 AbstractCegarLoop]: Abstraction has 1112 states and 1401 transitions. [2018-12-02 20:21:59,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:21:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1401 transitions. [2018-12-02 20:21:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 20:21:59,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:21:59,287 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2018-12-02 20:21:59,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:21:59,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 800655393, now seen corresponding path program 1 times [2018-12-02 20:21:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:21:59,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:59,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:21:59,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:21:59,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:21:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:21:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:21:59,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:21:59,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:21:59,340 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-12-02 20:21:59,342 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:21:59,368 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:21:59,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:21:59,636 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:21:59,637 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Performed 1714 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-02 20:21:59,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:21:59,647 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:21:59,931 INFO L227 lantSequenceWeakener]: Weakened 165 states. On average, predicates are now at 80.59% of their original sizes. [2018-12-02 20:21:59,932 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:21:59,952 INFO L418 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-12-02 20:21:59,952 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:21:59,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:21:59,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-02 20:21:59,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:21:59,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:21:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:21:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:21:59,954 INFO L87 Difference]: Start difference. First operand 1112 states and 1401 transitions. Second operand 6 states. [2018-12-02 20:22:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:01,802 INFO L93 Difference]: Finished difference Result 2354 states and 2955 transitions. [2018-12-02 20:22:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:22:01,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-12-02 20:22:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:01,806 INFO L225 Difference]: With dead ends: 2354 [2018-12-02 20:22:01,807 INFO L226 Difference]: Without dead ends: 1248 [2018-12-02 20:22:01,808 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 169 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 20:22:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-12-02 20:22:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1247. [2018-12-02 20:22:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2018-12-02 20:22:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1542 transitions. [2018-12-02 20:22:01,840 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1542 transitions. Word has length 174 [2018-12-02 20:22:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:01,840 INFO L480 AbstractCegarLoop]: Abstraction has 1247 states and 1542 transitions. [2018-12-02 20:22:01,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:22:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1542 transitions. [2018-12-02 20:22:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 20:22:01,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:22:01,844 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:22:01,844 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:22:01,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash -505056324, now seen corresponding path program 1 times [2018-12-02 20:22:01,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:22:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:01,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:22:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 20:22:01,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:01,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:22:01,914 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-12-02 20:22:01,915 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:22:01,919 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:22:01,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:22:02,127 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:22:02,128 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 4 different actions 4 times. Never widened. Performed 3434 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3434 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 20:22:02,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:02,130 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:22:02,328 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 82.02% of their original sizes. [2018-12-02 20:22:02,329 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:22:02,366 INFO L418 sIntCurrentIteration]: We unified 181 AI predicates to 181 [2018-12-02 20:22:02,366 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:22:02,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:22:02,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 20:22:02,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:22:02,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:22:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:22:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:22:02,367 INFO L87 Difference]: Start difference. First operand 1247 states and 1542 transitions. Second operand 10 states. [2018-12-02 20:22:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:05,127 INFO L93 Difference]: Finished difference Result 2492 states and 3113 transitions. [2018-12-02 20:22:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:22:05,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-12-02 20:22:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:05,131 INFO L225 Difference]: With dead ends: 2492 [2018-12-02 20:22:05,132 INFO L226 Difference]: Without dead ends: 1386 [2018-12-02 20:22:05,134 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 189 GetRequests, 173 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 20:22:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-12-02 20:22:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1384. [2018-12-02 20:22:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-12-02 20:22:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1689 transitions. [2018-12-02 20:22:05,163 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1689 transitions. Word has length 182 [2018-12-02 20:22:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:05,163 INFO L480 AbstractCegarLoop]: Abstraction has 1384 states and 1689 transitions. [2018-12-02 20:22:05,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:22:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1689 transitions. [2018-12-02 20:22:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-02 20:22:05,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:22:05,166 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:22:05,166 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:22:05,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash -543751618, now seen corresponding path program 1 times [2018-12-02 20:22:05,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:22:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:05,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:05,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:22:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 20:22:05,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:05,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:22:05,244 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-12-02 20:22:05,245 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:22:05,248 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:22:05,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:22:05,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:22:05,364 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 4 different actions 4 times. Never widened. Performed 3491 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3491 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 20:22:05,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:05,366 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:22:05,519 INFO L227 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 81.95% of their original sizes. [2018-12-02 20:22:05,519 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:22:05,551 INFO L418 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-12-02 20:22:05,551 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:22:05,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:22:05,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 20:22:05,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:22:05,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:22:05,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:22:05,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:22:05,552 INFO L87 Difference]: Start difference. First operand 1384 states and 1689 transitions. Second operand 10 states. [2018-12-02 20:22:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:08,154 INFO L93 Difference]: Finished difference Result 2766 states and 3403 transitions. [2018-12-02 20:22:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 20:22:08,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2018-12-02 20:22:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:08,160 INFO L225 Difference]: With dead ends: 2766 [2018-12-02 20:22:08,160 INFO L226 Difference]: Without dead ends: 1660 [2018-12-02 20:22:08,162 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 206 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 20:22:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2018-12-02 20:22:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2018-12-02 20:22:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2018-12-02 20:22:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 1984 transitions. [2018-12-02 20:22:08,188 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 1984 transitions. Word has length 215 [2018-12-02 20:22:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:08,189 INFO L480 AbstractCegarLoop]: Abstraction has 1658 states and 1984 transitions. [2018-12-02 20:22:08,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:22:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 1984 transitions. [2018-12-02 20:22:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-02 20:22:08,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:22:08,192 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:22:08,192 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:22:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1449533699, now seen corresponding path program 1 times [2018-12-02 20:22:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:22:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:08,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:22:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 20:22:08,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:08,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:22:08,264 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-02 20:22:08,264 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:22:08,266 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:22:08,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:22:08,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 20:22:08,525 INFO L272 AbstractInterpreter]: Visited 137 different actions 546 times. Merged at 7 different actions 28 times. Never widened. Performed 7366 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-02 20:22:08,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:08,526 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 20:22:08,704 INFO L227 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 83.64% of their original sizes. [2018-12-02 20:22:08,705 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 20:22:08,749 INFO L418 sIntCurrentIteration]: We unified 222 AI predicates to 222 [2018-12-02 20:22:08,749 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 20:22:08,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:22:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-12-02 20:22:08,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:22:08,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 20:22:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 20:22:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:22:08,750 INFO L87 Difference]: Start difference. First operand 1658 states and 1984 transitions. Second operand 10 states. [2018-12-02 20:22:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:11,125 INFO L93 Difference]: Finished difference Result 4019 states and 4972 transitions. [2018-12-02 20:22:11,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 20:22:11,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 223 [2018-12-02 20:22:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:11,130 INFO L225 Difference]: With dead ends: 4019 [2018-12-02 20:22:11,130 INFO L226 Difference]: Without dead ends: 2913 [2018-12-02 20:22:11,131 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-12-02 20:22:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2018-12-02 20:22:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2351. [2018-12-02 20:22:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2018-12-02 20:22:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 2834 transitions. [2018-12-02 20:22:11,169 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 2834 transitions. Word has length 223 [2018-12-02 20:22:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:11,169 INFO L480 AbstractCegarLoop]: Abstraction has 2351 states and 2834 transitions. [2018-12-02 20:22:11,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 20:22:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2834 transitions. [2018-12-02 20:22:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 20:22:11,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:22:11,173 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:22:11,173 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:22:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -621048195, now seen corresponding path program 1 times [2018-12-02 20:22:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:22:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:11,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:11,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:22:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:11,244 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 20:22:11,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:11,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:22:11,244 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-12-02 20:22:11,244 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], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-02 20:22:11,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 20:22:11,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 20:22:11,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 20:22:11,517 INFO L272 AbstractInterpreter]: Visited 138 different actions 552 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Performed 7624 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7624 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 20:22:11,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:11,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 20:22:11,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:11,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/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 20:22:11,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:11,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 20:22:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:11,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:22:11,681 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 20:22:11,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:22:11,750 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 20:22:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 20:22:11,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 20:22:11,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 20:22:11,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:22:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:22:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:22:11,777 INFO L87 Difference]: Start difference. First operand 2351 states and 2834 transitions. Second operand 11 states. [2018-12-02 20:22:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:12,580 INFO L93 Difference]: Finished difference Result 5161 states and 6292 transitions. [2018-12-02 20:22:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:22:12,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 226 [2018-12-02 20:22:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:12,586 INFO L225 Difference]: With dead ends: 5161 [2018-12-02 20:22:12,586 INFO L226 Difference]: Without dead ends: 3227 [2018-12-02 20:22:12,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 453 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:22:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-12-02 20:22:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2800. [2018-12-02 20:22:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2018-12-02 20:22:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3305 transitions. [2018-12-02 20:22:12,656 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3305 transitions. Word has length 226 [2018-12-02 20:22:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 2800 states and 3305 transitions. [2018-12-02 20:22:12,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:22:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3305 transitions. [2018-12-02 20:22:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 20:22:12,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:22:12,662 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:22:12,662 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:22:12,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:22:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1599641319, now seen corresponding path program 2 times [2018-12-02 20:22:12,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:22:12,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:12,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:22:12,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:22:12,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:22:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:22:12,795 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 20:22:12,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:12,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 20:22:12,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 20:22:12,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 20:22:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:22:12,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/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 20:22:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 20:22:12,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 20:22:12,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 20:22:12,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:22:12,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:22:12,895 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 20:22:12,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 20:22:12,946 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 20:22:12,962 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 20:22:12,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-12-02 20:22:12,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:22:12,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:22:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:22:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 20:22:12,963 INFO L87 Difference]: Start difference. First operand 2800 states and 3305 transitions. Second operand 3 states. [2018-12-02 20:22:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:22:13,186 INFO L93 Difference]: Finished difference Result 6690 states and 8053 transitions. [2018-12-02 20:22:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:22:13,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-12-02 20:22:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:22:13,186 INFO L225 Difference]: With dead ends: 6690 [2018-12-02 20:22:13,186 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 20:22:13,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 451 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 20:22:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 20:22:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 20:22:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 20:22:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 20:22:13,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2018-12-02 20:22:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:22:13,192 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 20:22:13,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:22:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 20:22:13,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 20:22:13,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 20:22:13,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:13,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 20:22:14,077 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 107 [2018-12-02 20:22:14,187 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2018-12-02 20:22:14,386 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 60 [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,388 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-02 20:22:14,389 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,390 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-02 20:22:14,391 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-02 20:22:14,392 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-02 20:22:14,393 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse26 (= 1 |old(~a17~0)|)) (.cse14 (= 1 ~a17~0))) (let ((.cse22 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a20~0)| ~a20~0)) (.cse24 (= |old(~a16~0)| ~a16~0)) (.cse25 (or (not (= ~a7~0 ~a17~0)) (not .cse14))) (.cse13 (not (= 1 |old(~a20~0)|))) (.cse15 (and (= |old(~a7~0)| |old(~a17~0)|) .cse26)) (.cse3 (not (= 8 ~a12~0)))) (let ((.cse8 (= 13 |old(~a8~0)|)) (.cse17 (or .cse13 .cse15 .cse3)) (.cse16 (and .cse22 .cse23 .cse24 .cse25)) (.cse9 (= 0 |old(~a16~0)|)) (.cse11 (= 0 |old(~a8~0)|)) (.cse5 (= ~a7~0 0)) (.cse7 (= ~a21~0 1)) (.cse19 (and .cse22 .cse23 .cse24)) (.cse10 (= |calculate_output_#in~input| 0)) (.cse6 (= ~a17~0 1)) (.cse18 (not (= 5 |old(~a16~0)|))) (.cse4 (not .cse26)) (.cse21 (= 6 |old(~a16~0)|)) (.cse0 (not (= 0 |old(~a7~0)|))) (.cse1 (not (= 1 |old(~a21~0)|))) (.cse2 (not (= 15 |old(~a8~0)|))) (.cse20 (< 4 |old(~a16~0)|)) (.cse12 (< 0 |old(~a20~0)|))) (and (or (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse3 .cse4)) (or (and .cse5 .cse6 .cse7) (and .cse5 (= ~a8~0 15) .cse7)) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse13 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 1 ~a21~0) .cse14) .cse3 (not (= 1 |old(~a7~0)|)) (not .cse8) .cse4) (or .cse8 .cse15 .cse3 .cse16 .cse12) (or (and .cse5 .cse7) (or .cse0 .cse1 .cse17 .cse9 .cse10 .cse11)) (or .cse17 .cse16) (or .cse6 .cse10 (or .cse0 .cse1 .cse2 (not (= 0 |old(~a20~0)|)) .cse18 .cse3 .cse4)) (or .cse19 .cse20 .cse3 .cse12) (or (or .cse21 .cse0 .cse1 .cse9 .cse3 .cse10 .cse11) (and .cse5 .cse22 .cse23 .cse24 .cse7) .cse12) (or .cse21 .cse13 .cse19 .cse3) (or .cse10 (or (and .cse6 (= ~a16~0 5)) (and (= ~a17~0 0) (= ~a16~0 6))) (and (or .cse0 .cse1 .cse13 .cse2 .cse18 .cse3 .cse4) (or (not .cse21) .cse0 .cse1 .cse13 .cse2 (not (= 0 |old(~a17~0)|)) .cse3))) (or .cse20 .cse25 .cse15 .cse3 .cse12))))) [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-02 20:22:14,394 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-02 20:22:14,395 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 20:22:14,396 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 20:22:14,396 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 20:22:14,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 20:22:14,397 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)|)) (and (= ~a17~0 1) (= ~a21~0 1) (= ~a7~0 0) (= |old(~a8~0)| ~a8~0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-12-02 20:22:14,397 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-12-02 20:22:14,397 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (<= ~a20~0 0)) (.cse2 (or (not (= ~a7~0 ~a17~0)) (not (= 1 ~a17~0)))) (.cse0 (not (= ~a16~0 6)))) (or (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and (= ~a7~0 0) (not (= main_~input~0 0)) .cse0 (= ~a21~0 1) .cse1) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 0 |old(~a7~0)|)) (and .cse2 (not (= ~a8~0 13)) .cse1) (and .cse1 (<= ~a16~0 4)) (and (= 1 ~a20~0) .cse2) (and (= |old(~a20~0)| ~a20~0) .cse0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)))) [2018-12-02 20:22:14,397 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-12-02 20:22:14,397 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-02 20:22:14,397 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a20~0 0)) (.cse2 (or (not (= ~a7~0 ~a17~0)) (not (= 1 ~a17~0)))) (.cse0 (not (= ~a16~0 6)))) (or (not (= 1 |old(~a21~0)|)) (and (and (= ~a7~0 0) (not (= main_~input~0 0)) .cse0 (= ~a21~0 1)) .cse1) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (not (= 0 |old(~a7~0)|)) (and .cse2 (not (= ~a8~0 13)) .cse1) (and .cse1 (<= ~a16~0 4)) (and (= 1 ~a20~0) .cse2) (and (= |old(~a20~0)| ~a20~0) .cse0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)))) [2018-12-02 20:22:14,397 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-12-02 20:22:14,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:22:14 BoogieIcfgContainer [2018-12-02 20:22:14,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:22:14,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:22:14,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:22:14,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:22:14,404 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:21:56" (3/4) ... [2018-12-02 20:22:14,407 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 20:22:14,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 20:22:14,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 20:22:14,411 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 20:22:14,417 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 20:22:14,418 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 20:22:14,436 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(1 == \old(a21)) || ((((a7 == 0 && !(input == 0)) && !(a16 == 6)) && a21 == 1) && a20 <= 0)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || !(0 == \old(a7))) || (((!(a7 == a17) || !(1 == a17)) && !(a8 == 13)) && a20 <= 0)) || (a20 <= 0 && a16 <= 4)) || (1 == a20 && (!(a7 == a17) || !(1 == a17)))) || (\old(a20) == a20 && !(a16 == 6))) || !(1 == \old(a17))) || !(15 == \old(a8)) [2018-12-02 20:22:14,481 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b616a1bb-3342-4df7-917a-7a778634a122/bin-2019/utaipan/witness.graphml [2018-12-02 20:22:14,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:22:14,482 INFO L168 Benchmark]: Toolchain (without parser) took 18886.92 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 986.2 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -62.8 MB). Peak memory consumption was 923.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,482 INFO L168 Benchmark]: CDTParser took 0.15 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 20:22:14,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.4 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.99 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,483 INFO L168 Benchmark]: Boogie Preprocessor took 37.46 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,483 INFO L168 Benchmark]: RCFGBuilder took 548.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 952.8 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,483 INFO L168 Benchmark]: TraceAbstraction took 17896.80 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 907.0 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -73.9 MB). Peak memory consumption was 833.1 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,484 INFO L168 Benchmark]: Witness Printer took 77.45 ms. Allocated memory is still 2.0 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-12-02 20:22:14,485 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.15 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 304.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -123.4 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.99 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.46 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 548.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 952.8 MB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17896.80 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 907.0 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -73.9 MB). Peak memory consumption was 833.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.45 ms. Allocated memory is still 2.0 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: ((((((((((!(1 == \old(a21)) || ((((a7 == 0 && !(input == 0)) && !(a16 == 6)) && a21 == 1) && a20 <= 0)) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || !(0 == \old(a7))) || (((!(a7 == a17) || !(1 == a17)) && !(a8 == 13)) && a20 <= 0)) || (a20 <= 0 && a16 <= 4)) || (1 == a20 && (!(a7 == a17) || !(1 == a17)))) || (\old(a20) == a20 && !(a16 == 6))) || !(1 == \old(a17))) || !(15 == \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 17.8s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 582 SDtfs, 5087 SDslu, 494 SDs, 0 SdLazy, 6729 SolverSat, 1063 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1790 GetRequests, 1679 SyntacticMatches, 9 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2800occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9972455615627249 AbsIntWeakeningRatio, 0.20759493670886076 AbsIntAvgWeakeningVarsNumRemoved, 28.935443037974682 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 116 PreInvPairs, 178 NumberOfFragments, 729 HoareAnnotationTreeSize, 116 FomulaSimplifications, 13151 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7965 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2420 NumberOfCodeBlocks, 2356 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2857 ConstructedInterpolants, 0 QuantifiedInterpolants, 1520931 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1005 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 1257/1471 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...