./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_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_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/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 64e5c46407a78b8946c1b8a8e041360873f42904 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:35:39,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:35:39,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:35:39,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:35:39,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:35:39,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:35:39,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:35:39,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:35:39,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:35:39,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:35:39,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:35:39,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:35:39,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:35:39,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:35:39,508 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:35:39,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:35:39,509 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:35:39,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:35:39,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:35:39,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:35:39,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:35:39,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:35:39,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:35:39,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:35:39,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:35:39,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:35:39,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:35:39,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:35:39,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:35:39,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:35:39,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:35:39,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:35:39,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:35:39,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:35:39,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:35:39,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:35:39,519 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 13:35:39,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:35:39,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:35:39,527 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:35:39,527 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:35:39,527 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 13:35:39,527 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 13:35:39,527 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 13:35:39,528 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 13:35:39,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:35:39,529 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:35:39,530 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:35:39,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:35:39,531 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:35:39,531 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 13:35:39,531 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_ffe4b9a8-2483-4323-9e4f-406ae74644de/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 -> 64e5c46407a78b8946c1b8a8e041360873f42904 [2018-12-02 13:35:39,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:35:39,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:35:39,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:35:39,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:35:39,559 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:35:39,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-12-02 13:35:39,594 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/data/52d113755/c06ffd8cf08c45cca9fbd0ab76dad03f/FLAG2a639e423 [2018-12-02 13:35:40,000 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:35:40,001 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/sv-benchmarks/c/eca-rers2012/Problem14_label05_true-unreach-call_false-termination.c [2018-12-02 13:35:40,007 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/data/52d113755/c06ffd8cf08c45cca9fbd0ab76dad03f/FLAG2a639e423 [2018-12-02 13:35:40,354 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/data/52d113755/c06ffd8cf08c45cca9fbd0ab76dad03f [2018-12-02 13:35:40,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:35:40,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:35:40,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:35:40,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:35:40,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:35:40,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1840ea76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40, skipping insertion in model container [2018-12-02 13:35:40,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:35:40,417 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:35:40,612 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:35:40,614 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:35:40,699 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:35:40,752 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:35:40,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40 WrapperNode [2018-12-02 13:35:40,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:35:40,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:35:40,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:35:40,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:35:40,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:35:40,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:35:40,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:35:40,774 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:35:40,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... [2018-12-02 13:35:40,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:35:40,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:35:40,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:35:40,817 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:35:40,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/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 13:35:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 13:35:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 13:35:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 13:35:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 13:35:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:35:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:35:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 13:35:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 13:35:41,568 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:35:41,568 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 13:35:41,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:41 BoogieIcfgContainer [2018-12-02 13:35:41,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:35:41,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:35:41,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:35:41,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:35:41,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:35:40" (1/3) ... [2018-12-02 13:35:41,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8c0efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:41, skipping insertion in model container [2018-12-02 13:35:41,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:40" (2/3) ... [2018-12-02 13:35:41,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8c0efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:41, skipping insertion in model container [2018-12-02 13:35:41,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:41" (3/3) ... [2018-12-02 13:35:41,576 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label05_true-unreach-call_false-termination.c [2018-12-02 13:35:41,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:35:41,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 13:35:41,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 13:35:41,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:35:41,631 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:35:41,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:35:41,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:35:41,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:35:41,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:35:41,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:35:41,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:35:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2018-12-02 13:35:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 13:35:41,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:41,655 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] [2018-12-02 13:35:41,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:41,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1411665610, now seen corresponding path program 1 times [2018-12-02 13:35:41,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:41,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:41,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:41,851 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 13:35:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:35:41,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:35:41,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:41,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:35:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:35:41,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:35:41,866 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2018-12-02 13:35:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:42,440 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2018-12-02 13:35:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:35:42,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 13:35:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:42,453 INFO L225 Difference]: With dead ends: 688 [2018-12-02 13:35:42,454 INFO L226 Difference]: Without dead ends: 372 [2018-12-02 13:35:42,458 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 13:35:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-02 13:35:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-12-02 13:35:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-02 13:35:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2018-12-02 13:35:42,511 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 69 [2018-12-02 13:35:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2018-12-02 13:35:42,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:35:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2018-12-02 13:35:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 13:35:42,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:42,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 13:35:42,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:42,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1477947551, now seen corresponding path program 1 times [2018-12-02 13:35:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:42,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:35:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:35:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 13:35:42,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:42,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:35:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:35:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:35:42,673 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2018-12-02 13:35:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:43,299 INFO L93 Difference]: Finished difference Result 1122 states and 1837 transitions. [2018-12-02 13:35:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:35:43,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-12-02 13:35:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:43,304 INFO L225 Difference]: With dead ends: 1122 [2018-12-02 13:35:43,305 INFO L226 Difference]: Without dead ends: 756 [2018-12-02 13:35:43,306 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 13:35:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-12-02 13:35:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2018-12-02 13:35:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-12-02 13:35:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2018-12-02 13:35:43,336 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 138 [2018-12-02 13:35:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:43,337 INFO L480 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2018-12-02 13:35:43,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:35:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2018-12-02 13:35:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 13:35:43,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:43,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 13:35:43,339 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:43,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1280489606, now seen corresponding path program 1 times [2018-12-02 13:35:43,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:43,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:35:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:35:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:35:43,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:35:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:35:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:35:43,415 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2018-12-02 13:35:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:44,025 INFO L93 Difference]: Finished difference Result 1904 states and 3099 transitions. [2018-12-02 13:35:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 13:35:44,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-12-02 13:35:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:44,029 INFO L225 Difference]: With dead ends: 1904 [2018-12-02 13:35:44,029 INFO L226 Difference]: Without dead ends: 1158 [2018-12-02 13:35:44,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:35:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-12-02 13:35:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2018-12-02 13:35:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-12-02 13:35:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2018-12-02 13:35:44,056 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 139 [2018-12-02 13:35:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:44,056 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2018-12-02 13:35:44,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:35:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2018-12-02 13:35:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 13:35:44,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:44,058 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 13:35:44,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:44,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1200752790, now seen corresponding path program 1 times [2018-12-02 13:35:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:44,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 13:35:44,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:35:44,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:35:44,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:35:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:35:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:35:44,128 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2018-12-02 13:35:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:44,844 INFO L93 Difference]: Finished difference Result 2880 states and 4162 transitions. [2018-12-02 13:35:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 13:35:44,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-12-02 13:35:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:44,852 INFO L225 Difference]: With dead ends: 2880 [2018-12-02 13:35:44,852 INFO L226 Difference]: Without dead ends: 1748 [2018-12-02 13:35:44,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:35:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-12-02 13:35:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2018-12-02 13:35:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-12-02 13:35:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2018-12-02 13:35:44,893 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 141 [2018-12-02 13:35:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:44,893 INFO L480 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2018-12-02 13:35:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:35:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2018-12-02 13:35:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 13:35:44,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:44,897 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, 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, 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] [2018-12-02 13:35:44,897 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:44,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:44,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1200458230, now seen corresponding path program 1 times [2018-12-02 13:35:44,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:44,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 13:35:44,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:35:44,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:35:44,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:44,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:35:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:35:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:35:44,991 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 4 states. [2018-12-02 13:35:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:45,872 INFO L93 Difference]: Finished difference Result 4126 states and 5834 transitions. [2018-12-02 13:35:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:35:45,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-02 13:35:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:45,892 INFO L225 Difference]: With dead ends: 4126 [2018-12-02 13:35:45,892 INFO L226 Difference]: Without dead ends: 2806 [2018-12-02 13:35:45,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:35:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2018-12-02 13:35:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2258. [2018-12-02 13:35:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-12-02 13:35:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3058 transitions. [2018-12-02 13:35:45,951 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3058 transitions. Word has length 225 [2018-12-02 13:35:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:45,952 INFO L480 AbstractCegarLoop]: Abstraction has 2258 states and 3058 transitions. [2018-12-02 13:35:45,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:35:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3058 transitions. [2018-12-02 13:35:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-12-02 13:35:45,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:45,957 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:45,957 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:45,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 451455961, now seen corresponding path program 1 times [2018-12-02 13:35:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:45,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 124 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 13:35:46,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:35:46,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:35:46,183 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 335 with the following transitions: [2018-12-02 13:35:46,185 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:35:46,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:35:46,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:35:48,123 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:35:48,123 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Performed 1549 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1549 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Never found a fixpoint. Largest state had 24 variables. [2018-12-02 13:35:48,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:48,134 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:35:49,773 INFO L227 lantSequenceWeakener]: Weakened 325 states. On average, predicates are now at 77.99% of their original sizes. [2018-12-02 13:35:49,773 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:35:49,799 INFO L418 sIntCurrentIteration]: We unified 333 AI predicates to 333 [2018-12-02 13:35:49,800 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:35:49,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:35:49,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-12-02 13:35:49,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:35:49,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 13:35:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 13:35:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 13:35:49,801 INFO L87 Difference]: Start difference. First operand 2258 states and 3058 transitions. Second operand 6 states. [2018-12-02 13:35:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:35:58,758 INFO L93 Difference]: Finished difference Result 4329 states and 5896 transitions. [2018-12-02 13:35:58,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:35:58,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2018-12-02 13:35:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:35:58,762 INFO L225 Difference]: With dead ends: 4329 [2018-12-02 13:35:58,762 INFO L226 Difference]: Without dead ends: 2259 [2018-12-02 13:35:58,764 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:35:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2018-12-02 13:35:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2258. [2018-12-02 13:35:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-12-02 13:35:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3032 transitions. [2018-12-02 13:35:58,790 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3032 transitions. Word has length 334 [2018-12-02 13:35:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:35:58,790 INFO L480 AbstractCegarLoop]: Abstraction has 2258 states and 3032 transitions. [2018-12-02 13:35:58,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 13:35:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3032 transitions. [2018-12-02 13:35:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-02 13:35:58,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:35:58,796 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:58,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:35:58,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:35:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -614545183, now seen corresponding path program 1 times [2018-12-02 13:35:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:35:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:58,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:35:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:35:58,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:35:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:35:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 272 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 13:35:59,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:35:59,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:35:59,238 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 419 with the following transitions: [2018-12-02 13:35:59,239 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:35:59,241 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:35:59,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:36:02,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:36:02,109 INFO L272 AbstractInterpreter]: Visited 162 different actions 317 times. Merged at 3 different actions 3 times. Never widened. Performed 3215 root evaluator evaluations with a maximum evaluation depth of 22. Performed 3215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 13:36:02,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:36:02,111 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:36:03,657 INFO L227 lantSequenceWeakener]: Weakened 415 states. On average, predicates are now at 77.88% of their original sizes. [2018-12-02 13:36:03,657 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:36:03,701 INFO L418 sIntCurrentIteration]: We unified 417 AI predicates to 417 [2018-12-02 13:36:03,701 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:36:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:36:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-12-02 13:36:03,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:36:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:36:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:36:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:36:03,702 INFO L87 Difference]: Start difference. First operand 2258 states and 3032 transitions. Second operand 10 states. [2018-12-02 13:36:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:36:21,852 INFO L93 Difference]: Finished difference Result 4726 states and 6320 transitions. [2018-12-02 13:36:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 13:36:21,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 418 [2018-12-02 13:36:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:36:21,858 INFO L225 Difference]: With dead ends: 4726 [2018-12-02 13:36:21,858 INFO L226 Difference]: Without dead ends: 2441 [2018-12-02 13:36:21,861 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 426 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:36:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-12-02 13:36:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2440. [2018-12-02 13:36:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2018-12-02 13:36:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3218 transitions. [2018-12-02 13:36:21,914 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3218 transitions. Word has length 418 [2018-12-02 13:36:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:36:21,914 INFO L480 AbstractCegarLoop]: Abstraction has 2440 states and 3218 transitions. [2018-12-02 13:36:21,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:36:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3218 transitions. [2018-12-02 13:36:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-12-02 13:36:21,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:36:21,921 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-02 13:36:21,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:36:21,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:36:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash 821190502, now seen corresponding path program 1 times [2018-12-02 13:36:21,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:36:21,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:36:21,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:36:21,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:36:21,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:36:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:36:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 441 proven. 250 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-02 13:36:22,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:36:22,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:36:22,404 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 518 with the following transitions: [2018-12-02 13:36:22,404 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:36:22,406 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:36:22,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:36:25,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:36:25,145 INFO L272 AbstractInterpreter]: Visited 163 different actions 320 times. Merged at 4 different actions 4 times. Never widened. Performed 3197 root evaluator evaluations with a maximum evaluation depth of 22. Performed 3197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 13:36:25,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:36:25,146 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:36:26,658 INFO L227 lantSequenceWeakener]: Weakened 514 states. On average, predicates are now at 77.78% of their original sizes. [2018-12-02 13:36:26,658 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:36:26,735 INFO L418 sIntCurrentIteration]: We unified 516 AI predicates to 516 [2018-12-02 13:36:26,735 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:36:26,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:36:26,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-12-02 13:36:26,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:36:26,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 13:36:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 13:36:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 13:36:26,736 INFO L87 Difference]: Start difference. First operand 2440 states and 3218 transitions. Second operand 10 states. [2018-12-02 13:36:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:36:47,395 INFO L93 Difference]: Finished difference Result 4514 states and 6057 transitions. [2018-12-02 13:36:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:36:47,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 517 [2018-12-02 13:36:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:36:47,399 INFO L225 Difference]: With dead ends: 4514 [2018-12-02 13:36:47,399 INFO L226 Difference]: Without dead ends: 2444 [2018-12-02 13:36:47,400 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 524 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 13:36:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2018-12-02 13:36:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2018-12-02 13:36:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2018-12-02 13:36:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3211 transitions. [2018-12-02 13:36:47,426 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3211 transitions. Word has length 517 [2018-12-02 13:36:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:36:47,426 INFO L480 AbstractCegarLoop]: Abstraction has 2442 states and 3211 transitions. [2018-12-02 13:36:47,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 13:36:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3211 transitions. [2018-12-02 13:36:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-12-02 13:36:47,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:36:47,430 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-12-02 13:36:47,430 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:36:47,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:36:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1636558626, now seen corresponding path program 1 times [2018-12-02 13:36:47,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:36:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:36:47,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:36:47,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:36:47,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:36:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:36:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 476 proven. 112 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-02 13:36:47,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:36:47,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:36:47,761 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 554 with the following transitions: [2018-12-02 13:36:47,762 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:36:47,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:36:47,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:36:54,043 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 13:36:54,043 INFO L272 AbstractInterpreter]: Visited 163 different actions 482 times. Merged at 6 different actions 13 times. Never widened. Performed 5019 root evaluator evaluations with a maximum evaluation depth of 22. Performed 5019 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-02 13:36:54,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:36:54,045 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 13:36:54,922 INFO L227 lantSequenceWeakener]: Weakened 550 states. On average, predicates are now at 80.43% of their original sizes. [2018-12-02 13:36:54,922 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 13:36:54,952 INFO L418 sIntCurrentIteration]: We unified 552 AI predicates to 552 [2018-12-02 13:36:54,952 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 13:36:54,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:36:54,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-12-02 13:36:54,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:36:54,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 13:36:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 13:36:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 13:36:54,953 INFO L87 Difference]: Start difference. First operand 2442 states and 3211 transitions. Second operand 9 states. [2018-12-02 13:37:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:37:09,401 INFO L93 Difference]: Finished difference Result 5267 states and 7057 transitions. [2018-12-02 13:37:09,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 13:37:09,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 553 [2018-12-02 13:37:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:37:09,409 INFO L225 Difference]: With dead ends: 5267 [2018-12-02 13:37:09,409 INFO L226 Difference]: Without dead ends: 3197 [2018-12-02 13:37:09,411 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 559 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-12-02 13:37:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-12-02 13:37:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3182. [2018-12-02 13:37:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2018-12-02 13:37:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4155 transitions. [2018-12-02 13:37:09,465 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4155 transitions. Word has length 553 [2018-12-02 13:37:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:37:09,466 INFO L480 AbstractCegarLoop]: Abstraction has 3182 states and 4155 transitions. [2018-12-02 13:37:09,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 13:37:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4155 transitions. [2018-12-02 13:37:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-12-02 13:37:09,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:37:09,474 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:09,474 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:37:09,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:37:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1862933583, now seen corresponding path program 1 times [2018-12-02 13:37:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:37:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:09,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:37:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:09,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:37:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:37:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 477 proven. 363 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-12-02 13:37:10,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:10,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:37:10,199 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 621 with the following transitions: [2018-12-02 13:37:10,199 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:37:10,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:37:10,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:37:14,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 13:37:14,240 INFO L272 AbstractInterpreter]: Visited 190 different actions 756 times. Merged at 8 different actions 29 times. Widened at 1 different actions 1 times. Performed 8312 root evaluator evaluations with a maximum evaluation depth of 21. Performed 8312 inverse root evaluator evaluations with a maximum inverse evaluation depth of 21. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-02 13:37:14,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:37:14,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 13:37:14,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:14,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/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 13:37:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:37:14,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 13:37:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:37:14,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:37:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 777 proven. 2 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-02 13:37:14,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:37:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-02 13:37:14,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 13:37:14,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2018-12-02 13:37:14,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 13:37:14,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 13:37:14,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 13:37:14,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-12-02 13:37:14,995 INFO L87 Difference]: Start difference. First operand 3182 states and 4155 transitions. Second operand 17 states. [2018-12-02 13:37:15,425 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-12-02 13:37:18,070 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-02 13:37:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:37:20,020 INFO L93 Difference]: Finished difference Result 6086 states and 8348 transitions. [2018-12-02 13:37:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 13:37:20,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 620 [2018-12-02 13:37:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:37:20,029 INFO L225 Difference]: With dead ends: 6086 [2018-12-02 13:37:20,029 INFO L226 Difference]: Without dead ends: 3276 [2018-12-02 13:37:20,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1313 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=620, Invalid=2350, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 13:37:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2018-12-02 13:37:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3210. [2018-12-02 13:37:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3210 states. [2018-12-02 13:37:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 4047 transitions. [2018-12-02 13:37:20,072 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 4047 transitions. Word has length 620 [2018-12-02 13:37:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:37:20,073 INFO L480 AbstractCegarLoop]: Abstraction has 3210 states and 4047 transitions. [2018-12-02 13:37:20,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 13:37:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 4047 transitions. [2018-12-02 13:37:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-12-02 13:37:20,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:37:20,077 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-12-02 13:37:20,077 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:37:20,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:37:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1780963522, now seen corresponding path program 1 times [2018-12-02 13:37:20,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:37:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:37:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:20,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:37:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:37:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 621 proven. 458 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-12-02 13:37:20,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:20,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:37:20,691 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 626 with the following transitions: [2018-12-02 13:37:20,691 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [461], [463], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [830], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2018-12-02 13:37:20,693 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:37:20,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:37:27,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 13:37:27,691 INFO L272 AbstractInterpreter]: Visited 165 different actions 654 times. Merged at 8 different actions 27 times. Never widened. Performed 6981 root evaluator evaluations with a maximum evaluation depth of 22. Performed 6981 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 8 fixpoints after 3 different actions. Largest state had 24 variables. [2018-12-02 13:37:27,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:37:27,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 13:37:27,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:27,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/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 13:37:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:37:27,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 13:37:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:37:27,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:37:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 945 proven. 2 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2018-12-02 13:37:28,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:37:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 617 proven. 112 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-02 13:37:28,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 13:37:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-02 13:37:28,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 13:37:28,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 13:37:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 13:37:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:37:28,417 INFO L87 Difference]: Start difference. First operand 3210 states and 4047 transitions. Second operand 17 states. [2018-12-02 13:37:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:37:30,274 INFO L93 Difference]: Finished difference Result 6572 states and 8690 transitions. [2018-12-02 13:37:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 13:37:30,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 625 [2018-12-02 13:37:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:37:30,279 INFO L225 Difference]: With dead ends: 6572 [2018-12-02 13:37:30,279 INFO L226 Difference]: Without dead ends: 3495 [2018-12-02 13:37:30,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1298 GetRequests, 1256 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=1376, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 13:37:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2018-12-02 13:37:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3384. [2018-12-02 13:37:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-12-02 13:37:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3738 transitions. [2018-12-02 13:37:30,325 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3738 transitions. Word has length 625 [2018-12-02 13:37:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:37:30,325 INFO L480 AbstractCegarLoop]: Abstraction has 3384 states and 3738 transitions. [2018-12-02 13:37:30,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 13:37:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3738 transitions. [2018-12-02 13:37:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-12-02 13:37:30,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:37:30,332 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2018-12-02 13:37:30,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:37:30,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:37:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1805358589, now seen corresponding path program 2 times [2018-12-02 13:37:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:37:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:37:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:37:30,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:37:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:37:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 655 proven. 153 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-12-02 13:37:30,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:30,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:37:30,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 13:37:30,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 13:37:30,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:37:30,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:37:30,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 13:37:30,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 13:37:30,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 13:37:30,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 13:37:30,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:37:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-12-02 13:37:31,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:37:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-12-02 13:37:31,290 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 13:37:31,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-12-02 13:37:31,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:37:31,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:37:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:37:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:37:31,291 INFO L87 Difference]: Start difference. First operand 3384 states and 3738 transitions. Second operand 3 states. [2018-12-02 13:37:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:37:33,855 INFO L93 Difference]: Finished difference Result 7314 states and 8184 transitions. [2018-12-02 13:37:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:37:33,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 730 [2018-12-02 13:37:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:37:33,856 INFO L225 Difference]: With dead ends: 7314 [2018-12-02 13:37:33,856 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 13:37:33,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1465 GetRequests, 1459 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 13:37:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 13:37:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 13:37:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 13:37:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 13:37:33,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 730 [2018-12-02 13:37:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:37:33,863 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 13:37:33,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:37:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 13:37:33,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 13:37:33,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 13:37:33,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:33,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,061 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 211 [2018-12-02 13:37:34,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 13:37:34,590 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 60 [2018-12-02 13:37:34,935 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 61 [2018-12-02 13:37:35,216 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 61 [2018-12-02 13:37:35,217 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,218 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,219 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-02 13:37:35,220 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,221 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-02 13:37:35,222 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse0 (= 7 |old(~a21~0)|)) (.cse3 (= 9 |old(~a15~0)|)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse2 (and (= ~a12~0 |old(~a12~0)|) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)))) (and (or (= 9 |old(~a21~0)|) .cse0 .cse1 .cse2) (or .cse2 (or .cse0 .cse3) .cse1) (or .cse2 (= 5 |old(~a15~0)|) .cse1 .cse3) (or (not (= 6 |old(~a21~0)|)) (or (< 0 (+ |old(~a12~0)| 49)) .cse3) .cse2) (or .cse1 .cse2 (forall ((v_~a12~0_488 Int)) (let ((.cse5 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse4 (div .cse5 10))) (or (< |old(~a12~0)| (+ (div .cse4 5) 56)) (< .cse4 0) (< .cse5 0) (<= (+ v_~a12~0_488 43) 0)))))))) [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-02 13:37:35,223 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-02 13:37:35,224 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,225 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-02 13:37:35,226 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,227 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-02 13:37:35,228 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-02 13:37:35,229 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-02 13:37:35,230 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-02 13:37:35,231 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-02 13:37:35,232 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 13:37:35,233 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 8 ~a15~0) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) [2018-12-02 13:37:35,233 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 13:37:35,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 13:37:35,234 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= 7 |old(~a21~0)|)) (and (= 8 ~a15~0) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (not (= 1 |old(~a24~0)|)) (not (= 8 |old(~a15~0)|)) (not (= 0 (+ |old(~a12~0)| 49)))) [2018-12-02 13:37:35,234 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-12-02 13:37:35,234 INFO L444 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a21~0))) (.cse4 (not (= ~a15~0 9))) (.cse1 (= 1 ~a24~0))) (or (not (= 8 |old(~a15~0)|)) (and (not (= ~a21~0 9)) .cse0 .cse1) (not (= 7 |old(~a21~0)|)) (not (= 0 (+ |old(~a12~0)| 49))) (and (= ~a24~0 |old(~a24~0)|) (exists ((v_~a12~0_488 Int)) (let ((.cse3 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse2 (div .cse3 10))) (and (<= (+ (div .cse2 5) 56) ~a12~0) (<= 0 .cse3) (< 0 (+ v_~a12~0_488 43)) (<= 0 .cse2)))))) (and .cse4 (= 6 ~a21~0) (<= (+ ~a12~0 49) 0)) (and .cse4 .cse0 .cse1) (and .cse4 .cse1 (not (= ~a15~0 5))) (not (= 1 |old(~a24~0)|)))) [2018-12-02 13:37:35,234 INFO L448 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-12-02 13:37:35,234 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-02 13:37:35,234 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse0 (not (= 7 ~a21~0))) (.cse4 (not (= ~a15~0 9))) (.cse1 (= 1 ~a24~0))) (or (not (= 8 |old(~a15~0)|)) (and (not (= ~a21~0 9)) .cse0 .cse1) (not (= 7 |old(~a21~0)|)) (not (= 0 (+ |old(~a12~0)| 49))) (and (= ~a24~0 |old(~a24~0)|) (exists ((v_~a12~0_488 Int)) (let ((.cse3 (+ (* 9 v_~a12~0_488) 504))) (let ((.cse2 (div .cse3 10))) (and (<= (+ (div .cse2 5) 56) ~a12~0) (<= 0 .cse3) (< 0 (+ v_~a12~0_488 43)) (<= 0 .cse2)))))) (and .cse4 (= 6 ~a21~0) (<= (+ ~a12~0 49) 0)) (and .cse4 .cse0 .cse1) (and .cse4 .cse1 (not (= ~a15~0 5))) (not (= 1 |old(~a24~0)|)))) [2018-12-02 13:37:35,234 INFO L448 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2018-12-02 13:37:35,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,243 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:37:35 BoogieIcfgContainer [2018-12-02 13:37:35,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:37:35,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:37:35,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:37:35,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:37:35,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:41" (3/4) ... [2018-12-02 13:37:35,250 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 13:37:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 13:37:35,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 13:37:35,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 13:37:35,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 13:37:35,263 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 13:37:35,279 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(8 == \old(a15)) || ((!(a21 == 9) && !(7 == a21)) && 1 == a24)) || !(7 == \old(a21))) || !(0 == \old(a12) + 49)) || (a24 == \old(a24) && (\exists v_~a12~0_488 : int :: (((9 * v_~a12~0_488 + 504) / 10 / 5 + 56 <= a12 && 0 <= 9 * v_~a12~0_488 + 504) && 0 < v_~a12~0_488 + 43) && 0 <= (9 * v_~a12~0_488 + 504) / 10))) || ((!(a15 == 9) && 6 == a21) && a12 + 49 <= 0)) || ((!(a15 == 9) && !(7 == a21)) && 1 == a24)) || ((!(a15 == 9) && 1 == a24) && !(a15 == 5))) || !(1 == \old(a24)) [2018-12-02 13:37:35,352 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ffe4b9a8-2483-4323-9e4f-406ae74644de/bin-2019/utaipan/witness.graphml [2018-12-02 13:37:35,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:37:35,353 INFO L168 Benchmark]: Toolchain (without parser) took 114991.80 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 945.9 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-02 13:37:35,353 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:37:35,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. [2018-12-02 13:37:35,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:37:35,354 INFO L168 Benchmark]: Boogie Preprocessor took 42.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 13:37:35,354 INFO L168 Benchmark]: RCFGBuilder took 751.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.7 MB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 11.5 GB. [2018-12-02 13:37:35,355 INFO L168 Benchmark]: TraceAbstraction took 113676.44 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 961.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 13:37:35,355 INFO L168 Benchmark]: Witness Printer took 105.83 ms. Allocated memory is still 4.8 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:37:35,356 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 59.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 751.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 961.7 MB in the end (delta: 121.4 MB). Peak memory consumption was 121.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113676.44 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 961.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 105.83 ms. Allocated memory is still 4.8 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 193]: 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: 880]: Loop Invariant [2018-12-02 13:37:35,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] [2018-12-02 13:37:35,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_488,QUANTIFIED] Derived loop invariant: (((((((!(8 == \old(a15)) || ((!(a21 == 9) && !(7 == a21)) && 1 == a24)) || !(7 == \old(a21))) || !(0 == \old(a12) + 49)) || (a24 == \old(a24) && (\exists v_~a12~0_488 : int :: (((9 * v_~a12~0_488 + 504) / 10 / 5 + 56 <= a12 && 0 <= 9 * v_~a12~0_488 + 504) && 0 < v_~a12~0_488 + 43) && 0 <= (9 * v_~a12~0_488 + 504) / 10))) || ((!(a15 == 9) && 6 == a21) && a12 + 49 <= 0)) || ((!(a15 == 9) && !(7 == a21)) && 1 == a24)) || ((!(a15 == 9) && 1 == a24) && !(a15 == 5))) || !(1 == \old(a24)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 113.6s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 75.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1078 SDtfs, 8084 SDslu, 809 SDs, 0 SdLazy, 14551 SolverSat, 2471 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 64.0s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 5957 GetRequests, 5778 SyntacticMatches, 5 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3384occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 24.8s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9977057894304209 AbsIntWeakeningRatio, 0.0737073707370737 AbsIntAvgWeakeningVarsNumRemoved, 16.31133113311331 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1190 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 151 PreInvPairs, 221 NumberOfFragments, 439 HoareAnnotationTreeSize, 151 FomulaSimplifications, 22354 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12319 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 6484 NumberOfCodeBlocks, 5976 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8441 ConstructedInterpolants, 65 QuantifiedInterpolants, 23631439 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2176 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 11850/13753 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...