./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label05_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_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/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 49868ba3cc530a9d4dc385567f0a9711da3734c2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:56:18,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:56:18,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:56:18,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:56:18,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:56:18,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:56:18,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:56:18,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:56:18,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:56:18,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:56:18,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:56:18,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:56:18,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:56:18,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:56:18,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:56:18,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:56:18,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:56:18,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:56:18,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:56:18,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:56:18,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:56:18,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:56:18,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:56:18,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:56:18,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:56:18,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:56:18,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:56:18,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:56:18,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:56:18,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:56:18,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:56:18,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:56:18,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:56:18,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:56:18,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:56:18,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:56:18,612 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:56:18,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:56:18,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:56:18,623 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:56:18,623 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:56:18,623 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:56:18,623 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:56:18,623 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:56:18,623 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:56:18,624 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:56:18,624 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:56:18,624 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:56:18,624 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:56:18,624 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:56:18,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:56:18,625 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:56:18,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:56:18,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:56:18,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:56:18,625 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:56:18,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:56:18,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:56:18,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:56:18,627 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:56:18,628 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:56:18,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:56:18,628 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:56:18,628 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_4be548ac-7845-4a80-81b7-6ab285e59315/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 -> 49868ba3cc530a9d4dc385567f0a9711da3734c2 [2018-12-02 04:56:18,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:56:18,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:56:18,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:56:18,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:56:18,662 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:56:18,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-12-02 04:56:18,700 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/data/de1f7844a/25765cade59a4f50a601a30f4ffea10d/FLAG4143c2209 [2018-12-02 04:56:19,172 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:56:19,172 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-12-02 04:56:19,181 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/data/de1f7844a/25765cade59a4f50a601a30f4ffea10d/FLAG4143c2209 [2018-12-02 04:56:19,192 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/data/de1f7844a/25765cade59a4f50a601a30f4ffea10d [2018-12-02 04:56:19,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:56:19,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:56:19,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:56:19,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:56:19,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:56:19,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,200 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 04:56:19, skipping insertion in model container [2018-12-02 04:56:19,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:56:19,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:56:19,442 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:56:19,446 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:56:19,527 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:56:19,537 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:56:19,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19 WrapperNode [2018-12-02 04:56:19,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:56:19,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:56:19,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:56:19,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:56:19,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:56:19,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:56:19,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:56:19,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:56:19,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... [2018-12-02 04:56:19,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:56:19,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:56:19,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:56:19,590 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:56:19,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/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 04:56:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:56:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:56:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 04:56:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 04:56:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:56:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:56:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:56:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:56:20,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:56:20,177 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 04:56:20,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:20 BoogieIcfgContainer [2018-12-02 04:56:20,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:56:20,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:56:20,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:56:20,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:56:20,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:56:19" (1/3) ... [2018-12-02 04:56:20,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:56:20, skipping insertion in model container [2018-12-02 04:56:20,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:19" (2/3) ... [2018-12-02 04:56:20,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520b3e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:56:20, skipping insertion in model container [2018-12-02 04:56:20,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:20" (3/3) ... [2018-12-02 04:56:20,184 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-12-02 04:56:20,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:56:20,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:56:20,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:56:20,236 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:56:20,236 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:56:20,236 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:56:20,236 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:56:20,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:56:20,236 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:56:20,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:56:20,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:56:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-02 04:56:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-02 04:56:20,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:20,258 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, 1] [2018-12-02 04:56:20,259 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:20,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2092008314, now seen corresponding path program 1 times [2018-12-02 04:56:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:20,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:20,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:20,527 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 04:56:20,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:20,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:20,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:20,543 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-02 04:56:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:20,955 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-02 04:56:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:20,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-02 04:56:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:20,965 INFO L225 Difference]: With dead ends: 618 [2018-12-02 04:56:20,965 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 04:56:20,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 04:56:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-02 04:56:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-02 04:56:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-02 04:56:21,004 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 132 [2018-12-02 04:56:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:21,004 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-02 04:56:21,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-02 04:56:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 04:56:21,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:21,007 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-12-02 04:56:21,007 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:21,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash 682738721, now seen corresponding path program 1 times [2018-12-02 04:56:21,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:21,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:21,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:21,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:21,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:21,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:21,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:56:21,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:21,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:56:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:56:21,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:21,198 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2018-12-02 04:56:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:21,558 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2018-12-02 04:56:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:56:21,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-12-02 04:56:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:21,560 INFO L225 Difference]: With dead ends: 721 [2018-12-02 04:56:21,560 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 04:56:21,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 04:56:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-02 04:56:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-02 04:56:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2018-12-02 04:56:21,571 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 140 [2018-12-02 04:56:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:21,572 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2018-12-02 04:56:21,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:56:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2018-12-02 04:56:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 04:56:21,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:21,573 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-12-02 04:56:21,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:21,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2067720747, now seen corresponding path program 1 times [2018-12-02 04:56:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:21,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:21,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:21,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:56:21,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:21,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:56:21,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:56:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:21,731 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2018-12-02 04:56:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:22,078 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2018-12-02 04:56:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:56:22,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2018-12-02 04:56:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:22,080 INFO L225 Difference]: With dead ends: 717 [2018-12-02 04:56:22,080 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 04:56:22,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 04:56:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 04:56:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-02 04:56:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-02 04:56:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2018-12-02 04:56:22,089 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 146 [2018-12-02 04:56:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2018-12-02 04:56:22,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:56:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2018-12-02 04:56:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 04:56:22,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:22,091 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:56:22,091 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:22,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1033618530, now seen corresponding path program 1 times [2018-12-02 04:56:22,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:22,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:56:22,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:56:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:56:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:56:22,161 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2018-12-02 04:56:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:22,570 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2018-12-02 04:56:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:56:22,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-12-02 04:56:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:22,574 INFO L225 Difference]: With dead ends: 951 [2018-12-02 04:56:22,574 INFO L226 Difference]: Without dead ends: 637 [2018-12-02 04:56:22,575 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 04:56:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-02 04:56:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2018-12-02 04:56:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-02 04:56:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2018-12-02 04:56:22,595 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 154 [2018-12-02 04:56:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:22,595 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2018-12-02 04:56:22,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:56:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2018-12-02 04:56:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 04:56:22,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:22,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:22,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:22,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1394591014, now seen corresponding path program 1 times [2018-12-02 04:56:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:22,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:56:22,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:22,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:56:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:56:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:22,741 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2018-12-02 04:56:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:23,093 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2018-12-02 04:56:23,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:56:23,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-12-02 04:56:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:23,096 INFO L225 Difference]: With dead ends: 1330 [2018-12-02 04:56:23,096 INFO L226 Difference]: Without dead ends: 626 [2018-12-02 04:56:23,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-02 04:56:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-02 04:56:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-02 04:56:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2018-12-02 04:56:23,107 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 156 [2018-12-02 04:56:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:23,108 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2018-12-02 04:56:23,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:56:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2018-12-02 04:56:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 04:56:23,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:23,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:23,110 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:23,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 124353046, now seen corresponding path program 1 times [2018-12-02 04:56:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:23,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:23,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:23,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:23,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:56:23,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:23,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:56:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:56:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:23,202 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2018-12-02 04:56:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:23,549 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2018-12-02 04:56:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:56:23,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-12-02 04:56:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:23,553 INFO L225 Difference]: With dead ends: 1332 [2018-12-02 04:56:23,553 INFO L226 Difference]: Without dead ends: 626 [2018-12-02 04:56:23,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:56:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-02 04:56:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-02 04:56:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-02 04:56:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2018-12-02 04:56:23,566 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 158 [2018-12-02 04:56:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:23,566 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2018-12-02 04:56:23,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:56:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2018-12-02 04:56:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 04:56:23,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:23,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:23,568 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:23,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 660846734, now seen corresponding path program 1 times [2018-12-02 04:56:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:23,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:23,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:23,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:56:23,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:23,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:56:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:56:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:56:23,633 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2018-12-02 04:56:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:23,988 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2018-12-02 04:56:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:56:23,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-12-02 04:56:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:23,992 INFO L225 Difference]: With dead ends: 1858 [2018-12-02 04:56:23,992 INFO L226 Difference]: Without dead ends: 1238 [2018-12-02 04:56:23,993 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 04:56:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-12-02 04:56:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2018-12-02 04:56:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-02 04:56:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2018-12-02 04:56:24,013 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 162 [2018-12-02 04:56:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:24,013 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2018-12-02 04:56:24,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:56:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2018-12-02 04:56:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 04:56:24,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:24,016 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:24,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:24,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash -390409458, now seen corresponding path program 1 times [2018-12-02 04:56:24,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:24,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:24,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:24,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:24,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:56:24,074 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-02 04:56:24,075 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 04:56:24,103 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:56:24,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:56:24,465 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 04:56:24,467 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 4 different actions 4 times. Never widened. Performed 2982 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2982 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-02 04:56:24,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:24,476 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 04:56:24,753 INFO L227 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 82.75% of their original sizes. [2018-12-02 04:56:24,753 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 04:56:24,801 INFO L418 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-12-02 04:56:24,801 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 04:56:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:56:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-02 04:56:24,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:24,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:56:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:56:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:56:24,802 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 10 states. [2018-12-02 04:56:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:27,952 INFO L93 Difference]: Finished difference Result 3178 states and 4247 transitions. [2018-12-02 04:56:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 04:56:27,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2018-12-02 04:56:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:27,958 INFO L225 Difference]: With dead ends: 3178 [2018-12-02 04:56:27,958 INFO L226 Difference]: Without dead ends: 1966 [2018-12-02 04:56:27,961 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-02 04:56:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2018-12-02 04:56:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1956. [2018-12-02 04:56:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2018-12-02 04:56:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2481 transitions. [2018-12-02 04:56:27,988 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2481 transitions. Word has length 196 [2018-12-02 04:56:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:27,988 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 2481 transitions. [2018-12-02 04:56:27,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:56:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2481 transitions. [2018-12-02 04:56:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 04:56:27,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:27,991 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:56:27,992 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:27,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2027142497, now seen corresponding path program 1 times [2018-12-02 04:56:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:27,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:28,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:28,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:56:28,090 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-12-02 04:56:28,091 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 04:56:28,094 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:56:28,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:56:28,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:56:28,308 INFO L272 AbstractInterpreter]: Visited 138 different actions 409 times. Merged at 7 different actions 17 times. Never widened. Performed 4831 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-02 04:56:28,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:28,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:56:28,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:28,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/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 04:56:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:28,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:56:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:28,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:56:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 04:56:28,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:56:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 04:56:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 04:56:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-12-02 04:56:28,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 04:56:28,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 04:56:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 04:56:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-02 04:56:28,529 INFO L87 Difference]: Start difference. First operand 1956 states and 2481 transitions. Second operand 14 states. [2018-12-02 04:56:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:29,946 INFO L93 Difference]: Finished difference Result 4947 states and 6363 transitions. [2018-12-02 04:56:29,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 04:56:29,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 200 [2018-12-02 04:56:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:29,950 INFO L225 Difference]: With dead ends: 4947 [2018-12-02 04:56:29,950 INFO L226 Difference]: Without dead ends: 2545 [2018-12-02 04:56:29,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 04:56:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2018-12-02 04:56:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2246. [2018-12-02 04:56:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-12-02 04:56:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2634 transitions. [2018-12-02 04:56:29,983 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2634 transitions. Word has length 200 [2018-12-02 04:56:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:29,983 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 2634 transitions. [2018-12-02 04:56:29,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 04:56:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2634 transitions. [2018-12-02 04:56:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 04:56:29,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:29,986 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-12-02 04:56:29,986 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:29,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1559618823, now seen corresponding path program 1 times [2018-12-02 04:56:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:56:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:29,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:29,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:56:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:30,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:30,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 04:56:30,094 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-12-02 04:56:30,095 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-02 04:56:30,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 04:56:30,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 04:56:30,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 04:56:30,261 INFO L272 AbstractInterpreter]: Visited 137 different actions 402 times. Merged at 6 different actions 13 times. Never widened. Performed 4777 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-02 04:56:30,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:30,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 04:56:30,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:30,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/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 04:56:30,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:30,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 04:56:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:30,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:56:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 04:56:30,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 04:56:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 04:56:30,403 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:56:30,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-12-02 04:56:30,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:56:30,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:30,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:56:30,403 INFO L87 Difference]: Start difference. First operand 2246 states and 2634 transitions. Second operand 3 states. [2018-12-02 04:56:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:30,636 INFO L93 Difference]: Finished difference Result 4777 states and 5678 transitions. [2018-12-02 04:56:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:30,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-02 04:56:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:30,637 INFO L225 Difference]: With dead ends: 4777 [2018-12-02 04:56:30,637 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:56:30,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:56:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:56:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:56:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:56:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:56:30,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2018-12-02 04:56:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:30,642 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:56:30,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:56:30,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:56:30,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 04:56:30,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:30,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:56:31,170 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 81 [2018-12-02 04:56:31,296 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-12-02 04:56:31,386 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-12-02 04:56:31,387 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-12-02 04:56:31,388 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,389 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-12-02 04:56:31,390 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-12-02 04:56:31,391 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-12-02 04:56:31,392 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse7 (= |old(~a17~0)| ~a17~0)) (.cse8 (= |old(~a25~0)| ~a25~0)) (.cse9 (= ~a28~0 |old(~a28~0)|)) (.cse11 (= 1 |old(~a11~0)|)) (.cse22 (= 1 |old(~a19~0)|)) (.cse16 (= 1 |old(~a25~0)|)) (.cse19 (= 1 ~a11~0)) (.cse20 (= 1 ~a19~0))) (let ((.cse12 (< 9 |old(~a28~0)|)) (.cse15 (< 7 |old(~a17~0)|)) (.cse0 (and .cse19 .cse20)) (.cse3 (not .cse16)) (.cse21 (= 9 |old(~a28~0)|)) (.cse4 (not .cse22)) (.cse18 (not (= 7 |old(~a28~0)|))) (.cse5 (not (= 8 |old(~a17~0)|))) (.cse6 (not .cse11)) (.cse17 (= 8 |old(~a28~0)|)) (.cse14 (and .cse7 .cse8 .cse9)) (.cse1 (not (= 1 ~a21~0))) (.cse2 (not (= 10 |old(~a28~0)|))) (.cse13 (not (= |old(~a17~0)| 8))) (.cse10 (not (= ~a11~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse14 .cse15 .cse16) (or .cse1 .cse12 .cse17 .cse14 .cse15) (or .cse1 .cse18 .cse3 .cse4 .cse6 .cse0 (not (= 7 |old(~a17~0)|))) (or .cse1 .cse3 .cse4 .cse5 (and .cse19 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse20) (not .cse21) .cse6) (or .cse10 .cse1 .cse11 .cse13 .cse16) (or (or .cse1 .cse17 .cse21 .cse13) .cse14) (or (and (= ~a11~0 0) (= ~a19~0 1)) .cse1 .cse4 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse5 (= |calculate_output_#in~input| 0)) (or .cse22 .cse1 .cse18 .cse5 (and .cse19 (not .cse20)) .cse6 .cse16) (or (or .cse1 .cse17 .cse13 .cse16) .cse14) (or .cse1 .cse11 .cse2 .cse13 .cse10)))) [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-12-02 04:56:31,393 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-12-02 04:56:31,394 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:56:31,395 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-12-02 04:56:31,396 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 04:56:31,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 04:56:31,396 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-12-02 04:56:31,396 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 7)) (.cse2 (not (= ~a25~0 1))) (.cse3 (= |old(~a17~0)| ~a17~0)) (.cse1 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 (<= ~a28~0 9)) (and .cse2 .cse3 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse3 (not (= ~a11~0 1))) (and .cse0 .cse2 (= 10 ~a28~0)) (and .cse3 .cse1 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)))) [2018-12-02 04:56:31,396 INFO L448 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2018-12-02 04:56:31,396 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-12-02 04:56:31,396 INFO L444 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (<= ~a17~0 7)) (.cse2 (not (= ~a25~0 1))) (.cse3 (= |old(~a17~0)| ~a17~0)) (.cse1 (not (= ~a28~0 8)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 (<= ~a28~0 9)) (and .cse2 .cse3 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse3 (not (= ~a11~0 1))) (and .cse0 .cse2 (= 10 ~a28~0)) (and .cse3 .cse1 (not (= ~a28~0 9))) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)))) [2018-12-02 04:56:31,396 INFO L448 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-12-02 04:56:31,396 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-12-02 04:56:31,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:56:31 BoogieIcfgContainer [2018-12-02 04:56:31,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:56:31,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:56:31,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:56:31,403 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:56:31,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:20" (3/4) ... [2018-12-02 04:56:31,405 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 04:56:31,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 04:56:31,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 04:56:31,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 04:56:31,414 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 04:56:31,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 04:56:31,431 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || ((a17 <= 7 && !(a28 == 8)) && a28 <= 9)) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (\old(a17) == a17 && !(a11 == 1))) || ((a17 <= 7 && !(a25 == 1)) && 10 == a28)) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || !(8 == \old(a17)) [2018-12-02 04:56:31,473 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4be548ac-7845-4a80-81b7-6ab285e59315/bin-2019/utaipan/witness.graphml [2018-12-02 04:56:31,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:56:31,473 INFO L168 Benchmark]: Toolchain (without parser) took 12278.81 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 747.6 MB). Free memory was 941.6 MB in the beginning and 1.6 GB in the end (delta: -637.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: Boogie Preprocessor took 33.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: RCFGBuilder took 587.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,474 INFO L168 Benchmark]: TraceAbstraction took 11223.82 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 613.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -593.4 MB). Peak memory consumption was 710.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,475 INFO L168 Benchmark]: Witness Printer took 70.39 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:56:31,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 587.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.5 MB). Peak memory consumption was 109.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11223.82 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 613.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -593.4 MB). Peak memory consumption was 710.1 MB. Max. memory is 11.5 GB. * Witness Printer took 70.39 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || ((a17 <= 7 && !(a28 == 8)) && a28 <= 9)) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (\old(a17) == a17 && !(a11 == 1))) || ((a17 <= 7 && !(a25 == 1)) && 10 == a28)) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 11.1s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 605 SDtfs, 5830 SDslu, 618 SDs, 0 SdLazy, 7711 SolverSat, 1383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1145 GetRequests, 1053 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2246occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9976522994170052 AbsIntWeakeningRatio, 0.16923076923076924 AbsIntAvgWeakeningVarsNumRemoved, 26.866666666666667 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 340 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 85 PreInvPairs, 135 NumberOfFragments, 589 HoareAnnotationTreeSize, 85 FomulaSimplifications, 2318 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2311 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2078 NumberOfCodeBlocks, 2078 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2481 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005419 SizeOfPredicates, 2 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 757/791 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...