./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label12_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_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/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 e52247c97e0196dba144205e35fb286f9d95e245 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:56:32,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:56:32,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:56:32,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:56:32,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:56:32,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:56:32,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:56:32,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:56:32,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:56:32,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:56:32,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:56:32,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:56:32,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:56:32,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:56:32,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:56:32,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:56:32,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:56:32,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:56:32,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:56:32,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:56:32,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:56:32,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:56:32,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:56:32,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:56:32,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:56:32,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:56:32,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:56:32,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:56:32,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:56:32,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:56:32,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:56:32,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:56:32,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:56:32,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:56:32,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:56:32,283 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:56:32,283 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:56:32,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:56:32,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:56:32,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:56:32,292 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:56:32,292 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:56:32,292 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:56:32,292 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:56:32,292 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:56:32,293 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:56:32,293 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:56:32,293 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:56:32,293 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:56:32,293 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:56:32,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:56:32,294 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:56:32,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:56:32,294 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:56:32,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:56:32,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:56:32,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:56:32,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:56:32,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:56:32,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:56:32,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:56:32,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:56:32,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:56:32,297 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:56:32,297 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:56:32,297 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:56:32,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:56:32,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:56:32,297 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_870a9694-3df7-43e0-9bdf-40873c9e38cc/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 -> e52247c97e0196dba144205e35fb286f9d95e245 [2018-12-03 02:56:32,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:56:32,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:56:32,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:56:32,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:56:32,330 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:56:32,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-12-03 02:56:32,366 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/data/6ac2d85ca/486c12c7e3d9446dbb885fddc55ad46e/FLAGc8f4c2ee6 [2018-12-03 02:56:32,735 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:56:32,736 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-12-03 02:56:32,742 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/data/6ac2d85ca/486c12c7e3d9446dbb885fddc55ad46e/FLAGc8f4c2ee6 [2018-12-03 02:56:33,112 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/data/6ac2d85ca/486c12c7e3d9446dbb885fddc55ad46e [2018-12-03 02:56:33,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:56:33,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:56:33,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:56:33,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:56:33,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:56:33,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec9f2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33, skipping insertion in model container [2018-12-03 02:56:33,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:56:33,159 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:56:33,331 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:56:33,334 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:56:33,416 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:56:33,425 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:56:33,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33 WrapperNode [2018-12-03 02:56:33,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:56:33,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:56:33,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:56:33,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:56:33,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:56:33,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:56:33,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:56:33,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:56:33,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... [2018-12-03 02:56:33,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:56:33,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:56:33,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:56:33,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:56:33,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/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-03 02:56:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:56:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:56:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-03 02:56:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-03 02:56:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:56:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:56:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:56:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:56:34,057 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:56:34,058 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 02:56:34,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:56:34 BoogieIcfgContainer [2018-12-03 02:56:34,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:56:34,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:56:34,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:56:34,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:56:34,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:56:33" (1/3) ... [2018-12-03 02:56:34,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d398260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:56:34, skipping insertion in model container [2018-12-03 02:56:34,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:33" (2/3) ... [2018-12-03 02:56:34,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d398260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:56:34, skipping insertion in model container [2018-12-03 02:56:34,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:56:34" (3/3) ... [2018-12-03 02:56:34,063 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label12_true-unreach-call_false-termination.c [2018-12-03 02:56:34,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:56:34,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:56:34,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:56:34,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:56:34,104 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:56:34,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:56:34,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:56:34,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:56:34,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:56:34,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:56:34,105 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:56:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2018-12-03 02:56:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 02:56:34,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:34,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:34,127 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:34,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1251139866, now seen corresponding path program 1 times [2018-12-03 02:56:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:34,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:34,369 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-03 02:56:34,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:34,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:56:34,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:34,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:56:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:56:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:56:34,385 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2018-12-03 02:56:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:34,815 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-12-03 02:56:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:56:34,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-03 02:56:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:34,824 INFO L225 Difference]: With dead ends: 618 [2018-12-03 02:56:34,824 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:56:34,827 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-03 02:56:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:56:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:56:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:56:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2018-12-03 02:56:34,865 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 124 [2018-12-03 02:56:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:34,865 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2018-12-03 02:56:34,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:56:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2018-12-03 02:56:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 02:56:34,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:34,869 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:34,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:34,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1267937665, now seen corresponding path program 1 times [2018-12-03 02:56:34,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:34,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:34,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:35,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:35,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:35,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:35,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:35,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:35,036 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2018-12-03 02:56:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:35,413 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2018-12-03 02:56:35,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:35,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-03 02:56:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:35,415 INFO L225 Difference]: With dead ends: 721 [2018-12-03 02:56:35,415 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:56:35,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:56:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:56:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:56:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2018-12-03 02:56:35,426 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 132 [2018-12-03 02:56:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:35,427 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2018-12-03 02:56:35,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2018-12-03 02:56:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 02:56:35,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:35,429 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:35,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:35,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1536784181, now seen corresponding path program 1 times [2018-12-03 02:56:35,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:35,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:35,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:35,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:35,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:35,583 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2018-12-03 02:56:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:35,895 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2018-12-03 02:56:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:35,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2018-12-03 02:56:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:35,897 INFO L225 Difference]: With dead ends: 717 [2018-12-03 02:56:35,897 INFO L226 Difference]: Without dead ends: 320 [2018-12-03 02:56:35,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-03 02:56:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-12-03 02:56:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 02:56:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2018-12-03 02:56:35,908 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 138 [2018-12-03 02:56:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:35,908 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2018-12-03 02:56:35,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2018-12-03 02:56:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 02:56:35,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:35,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:35,910 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:35,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:35,910 INFO L82 PathProgramCache]: Analyzing trace with hash -564169218, now seen corresponding path program 1 times [2018-12-03 02:56:35,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:35,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:36,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:36,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:56:36,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:36,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:56:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:56:36,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:56:36,004 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2018-12-03 02:56:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:36,430 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2018-12-03 02:56:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:56:36,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-12-03 02:56:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:36,432 INFO L225 Difference]: With dead ends: 951 [2018-12-03 02:56:36,432 INFO L226 Difference]: Without dead ends: 637 [2018-12-03 02:56:36,433 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-03 02:56:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-03 02:56:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2018-12-03 02:56:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:56:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2018-12-03 02:56:36,446 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 146 [2018-12-03 02:56:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:36,446 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2018-12-03 02:56:36,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:56:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2018-12-03 02:56:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 02:56:36,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:36,448 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:36,448 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:36,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1274835258, now seen corresponding path program 1 times [2018-12-03 02:56:36,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:36,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:36,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:36,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:36,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:36,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:36,535 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2018-12-03 02:56:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:36,893 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2018-12-03 02:56:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:36,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-12-03 02:56:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:36,896 INFO L225 Difference]: With dead ends: 1330 [2018-12-03 02:56:36,896 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 02:56:36,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 02:56:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 02:56:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:56:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2018-12-03 02:56:36,913 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 148 [2018-12-03 02:56:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:36,913 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2018-12-03 02:56:36,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2018-12-03 02:56:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 02:56:36,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:36,915 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:36,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:36,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1427723146, now seen corresponding path program 1 times [2018-12-03 02:56:36,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:36,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:36,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:36,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:37,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:37,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:37,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:37,041 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2018-12-03 02:56:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:37,362 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2018-12-03 02:56:37,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:37,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-12-03 02:56:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:37,365 INFO L225 Difference]: With dead ends: 1332 [2018-12-03 02:56:37,365 INFO L226 Difference]: Without dead ends: 626 [2018-12-03 02:56:37,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-12-03 02:56:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2018-12-03 02:56:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-03 02:56:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2018-12-03 02:56:37,379 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 150 [2018-12-03 02:56:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:37,380 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2018-12-03 02:56:37,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2018-12-03 02:56:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 02:56:37,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:37,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:37,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:37,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 392356590, now seen corresponding path program 1 times [2018-12-03 02:56:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:37,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:37,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:37,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:56:37,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:56:37,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:56:37,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:56:37,465 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2018-12-03 02:56:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:37,857 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2018-12-03 02:56:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:56:37,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2018-12-03 02:56:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:37,862 INFO L225 Difference]: With dead ends: 1858 [2018-12-03 02:56:37,862 INFO L226 Difference]: Without dead ends: 1238 [2018-12-03 02:56:37,864 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-03 02:56:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-12-03 02:56:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2018-12-03 02:56:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-03 02:56:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2018-12-03 02:56:37,891 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 154 [2018-12-03 02:56:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:37,891 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2018-12-03 02:56:37,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:56:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2018-12-03 02:56:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 02:56:37,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:37,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:37,895 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:37,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1102274855, now seen corresponding path program 1 times [2018-12-03 02:56:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:37,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:37,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:37,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:56:37,984 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-03 02:56:37,985 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:56:38,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:56:38,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:56:38,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:56:38,475 INFO L272 AbstractInterpreter]: Visited 129 different actions 380 times. Merged at 6 different actions 15 times. Never widened. Performed 4530 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-03 02:56:38,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:38,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:56:38,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:38,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/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-03 02:56:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:38,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:56:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:38,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:56:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:56:38,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:56:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 02:56:38,641 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:56:38,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-12-03 02:56:38,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:56:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:56:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:56:38,643 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2018-12-03 02:56:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:38,952 INFO L93 Difference]: Finished difference Result 2869 states and 3867 transitions. [2018-12-03 02:56:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:56:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-03 02:56:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:38,956 INFO L225 Difference]: With dead ends: 2869 [2018-12-03 02:56:38,956 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 02:56:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 319 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:56:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 02:56:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2018-12-03 02:56:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-12-03 02:56:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2164 transitions. [2018-12-03 02:56:38,981 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2164 transitions. Word has length 159 [2018-12-03 02:56:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:38,981 INFO L480 AbstractCegarLoop]: Abstraction has 1657 states and 2164 transitions. [2018-12-03 02:56:38,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:56:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2164 transitions. [2018-12-03 02:56:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 02:56:38,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:38,984 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:38,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:38,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -188973714, now seen corresponding path program 1 times [2018-12-03 02:56:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:38,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:56:39,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:39,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:56:39,039 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-12-03 02:56:39,039 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:56:39,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:56:39,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:56:39,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:56:39,207 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 4 different actions 4 times. Never widened. Performed 2820 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2820 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-03 02:56:39,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:39,208 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:56:39,522 INFO L227 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 82.64% of their original sizes. [2018-12-03 02:56:39,522 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:56:39,587 INFO L418 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-12-03 02:56:39,587 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:56:39,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:56:39,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 02:56:39,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:39,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:56:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:56:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:56:39,589 INFO L87 Difference]: Start difference. First operand 1657 states and 2164 transitions. Second operand 10 states. [2018-12-03 02:56:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:42,370 INFO L93 Difference]: Finished difference Result 4204 states and 5485 transitions. [2018-12-03 02:56:42,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 02:56:42,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-12-03 02:56:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:42,379 INFO L225 Difference]: With dead ends: 4204 [2018-12-03 02:56:42,379 INFO L226 Difference]: Without dead ends: 2553 [2018-12-03 02:56:42,382 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-03 02:56:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2018-12-03 02:56:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2543. [2018-12-03 02:56:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2018-12-03 02:56:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3168 transitions. [2018-12-03 02:56:42,421 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3168 transitions. Word has length 188 [2018-12-03 02:56:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:42,422 INFO L480 AbstractCegarLoop]: Abstraction has 2543 states and 3168 transitions. [2018-12-03 02:56:42,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:56:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3168 transitions. [2018-12-03 02:56:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 02:56:42,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:42,426 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:42,426 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash -773432166, now seen corresponding path program 1 times [2018-12-03 02:56:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:42,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:42,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 02:56:42,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:42,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:56:42,484 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-03 02:56:42,484 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:56:42,486 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:56:42,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:56:42,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 02:56:42,627 INFO L272 AbstractInterpreter]: Visited 128 different actions 379 times. Merged at 6 different actions 15 times. Never widened. Performed 4375 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-03 02:56:42,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:42,628 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 02:56:42,761 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 84.66% of their original sizes. [2018-12-03 02:56:42,761 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 02:56:42,802 INFO L418 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2018-12-03 02:56:42,802 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 02:56:42,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 02:56:42,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2018-12-03 02:56:42,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:42,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:56:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:56:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:56:42,804 INFO L87 Difference]: Start difference. First operand 2543 states and 3168 transitions. Second operand 9 states. [2018-12-03 02:56:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:44,828 INFO L93 Difference]: Finished difference Result 6012 states and 7618 transitions. [2018-12-03 02:56:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 02:56:44,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2018-12-03 02:56:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:44,835 INFO L225 Difference]: With dead ends: 6012 [2018-12-03 02:56:44,835 INFO L226 Difference]: Without dead ends: 3475 [2018-12-03 02:56:44,838 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-03 02:56:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2018-12-03 02:56:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3021. [2018-12-03 02:56:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2018-12-03 02:56:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3732 transitions. [2018-12-03 02:56:44,876 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3732 transitions. Word has length 206 [2018-12-03 02:56:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:44,876 INFO L480 AbstractCegarLoop]: Abstraction has 3021 states and 3732 transitions. [2018-12-03 02:56:44,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:56:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3732 transitions. [2018-12-03 02:56:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 02:56:44,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:44,881 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:56:44,881 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:44,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1050205186, now seen corresponding path program 1 times [2018-12-03 02:56:44,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:44,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:44,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:44,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:44,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 02:56:44,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:44,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:56:44,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:44,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:56:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:56:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:56:44,936 INFO L87 Difference]: Start difference. First operand 3021 states and 3732 transitions. Second operand 3 states. [2018-12-03 02:56:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:45,188 INFO L93 Difference]: Finished difference Result 6043 states and 7500 transitions. [2018-12-03 02:56:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:56:45,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-12-03 02:56:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:45,196 INFO L225 Difference]: With dead ends: 6043 [2018-12-03 02:56:45,197 INFO L226 Difference]: Without dead ends: 3028 [2018-12-03 02:56:45,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:56:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2018-12-03 02:56:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2871. [2018-12-03 02:56:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2871 states. [2018-12-03 02:56:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3443 transitions. [2018-12-03 02:56:45,239 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3443 transitions. Word has length 230 [2018-12-03 02:56:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:45,240 INFO L480 AbstractCegarLoop]: Abstraction has 2871 states and 3443 transitions. [2018-12-03 02:56:45,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:56:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3443 transitions. [2018-12-03 02:56:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-03 02:56:45,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:45,245 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:45,245 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:45,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1876584024, now seen corresponding path program 1 times [2018-12-03 02:56:45,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:45,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:45,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:45,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 223 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 02:56:45,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:45,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:56:45,368 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-12-03 02:56:45,368 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [260], [263], [267], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [671], [673], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2018-12-03 02:56:45,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:56:45,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:56:45,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:56:45,527 INFO L272 AbstractInterpreter]: Visited 132 different actions 389 times. Merged at 7 different actions 19 times. Never widened. Performed 4625 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4625 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-03 02:56:45,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:45,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:56:45,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:56:45,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/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-03 02:56:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:45,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:56:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:45,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:56:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 02:56:45,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:56:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 02:56:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:56:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-03 02:56:45,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:56:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:56:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:56:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:56:45,761 INFO L87 Difference]: Start difference. First operand 2871 states and 3443 transitions. Second operand 11 states. [2018-12-03 02:56:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:49,238 INFO L93 Difference]: Finished difference Result 7272 states and 9020 transitions. [2018-12-03 02:56:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 02:56:49,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 295 [2018-12-03 02:56:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:49,238 INFO L225 Difference]: With dead ends: 7272 [2018-12-03 02:56:49,238 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 02:56:49,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 603 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 02:56:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 02:56:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 02:56:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 02:56:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 02:56:49,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-12-03 02:56:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:49,247 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 02:56:49,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:56:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 02:56:49,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 02:56:49,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 02:56:49,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:49,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 02:56:50,293 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 94 [2018-12-03 02:56:50,496 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2018-12-03 02:56:50,684 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 63 [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= |old(~a25~0)| ~a25~0)) [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-12-03 02:56:50,686 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-12-03 02:56:50,687 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,688 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-12-03 02:56:50,689 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 526) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-03 02:56:50,690 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-12-03 02:56:50,691 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,692 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,693 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse3 (not (= 1 ~a21~0))) (.cse23 (< |old(~a28~0)| 10)) (.cse18 (= 1 |old(~a11~0)|)) (.cse11 (= 1 |old(~a19~0)|)) (.cse17 (= 1 |old(~a25~0)|)) (.cse19 (not (= ~a11~0 1))) (.cse25 (<= ~a17~0 |old(~a17~0)|)) (.cse21 (= |old(~a28~0)| ~a28~0)) (.cse26 (= |old(~a19~0)| ~a19~0)) (.cse22 (= |old(~a25~0)| ~a25~0))) (let ((.cse5 (= 0 |old(~a28~0)|)) (.cse9 (and .cse25 .cse21 .cse26 .cse22)) (.cse14 (= 8 ~a17~0)) (.cse15 (= 1 ~a19~0)) (.cse2 (< 7 |old(~a17~0)|)) (.cse6 (not (= 8 |old(~a17~0)|))) (.cse7 (= |calculate_output_#in~input| 0)) (.cse24 (and .cse25 .cse21 .cse26 .cse22 .cse19)) (.cse20 (= 9 |old(~a28~0)|)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse8 (not .cse17)) (.cse4 (not .cse11)) (.cse16 (not .cse18)) (.cse13 (= 1 ~a11~0)) (.cse0 (or .cse3 .cse23 .cse17)) (.cse10 (< 0 |old(~a19~0)|)) (.cse1 (and .cse25 .cse26 .cse21 .cse22))) (and (or .cse0 .cse1 .cse2) (or .cse3 (= ~a11~0 0) .cse4 .cse5 (not (= 0 |old(~a11~0)|)) .cse6 .cse7) (or .cse3 .cse8 .cse9 .cse10 .cse2) (or .cse11 .cse3 .cse12 .cse6 (and (= 7 ~a28~0) (not (= ~a25~0 1)) .cse13 .cse14 (not .cse15)) .cse16 .cse17) (or .cse3 .cse18 .cse19 .cse8 .cse20) (or (or .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse21 (= ~a17~0 8) .cse22 (= ~a19~0 1))) (or .cse3 .cse9 .cse8 .cse20 (< |old(~a19~0)| 1)) (or (and .cse13 .cse14) .cse3 (not (= 10 |old(~a28~0)|)) .cse8 .cse4 .cse6 .cse16) (or .cse3 .cse18 .cse23 .cse6 .cse7 .cse19) (or .cse3 .cse8 .cse4 .cse6 (and .cse13 (= 1 ~a25~0) (= 9 ~a28~0) .cse14 .cse15) (not .cse20) .cse16) (or .cse11 .cse3 .cse18 .cse24 .cse2 .cse17) (or (or .cse3 .cse18 .cse8 .cse4 .cse6 .cse7) .cse19) (or .cse11 .cse3 .cse18 .cse24 .cse20) (or .cse3 .cse12 .cse8 .cse4 .cse16 (and .cse13 (= 7 ~a17~0)) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse10 .cse1)))) [2018-12-03 02:56:50,693 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-12-03 02:56:50,694 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-12-03 02:56:50,695 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-12-03 02:56:50,696 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 02:56:50,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 02:56:50,696 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7)) (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-12-03 02:56:50,697 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a19~0 1))) (let ((.cse2 (not (= ~a25~0 1))) (.cse1 (not .cse7)) (.cse3 (not (= ~a11~0 1))) (.cse0 (<= ~a17~0 7)) (.cse4 (<= ~a17~0 |old(~a17~0)|)) (.cse6 (= 1 ~a25~0)) (.cse5 (not (= ~a28~0 9)))) (or (and .cse0 (<= 10 ~a28~0)) (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and .cse1 .cse0 .cse2 .cse3) (not (= 0 |old(~a11~0)|)) (and (= 7 ~a28~0) .cse2 (= 8 ~a17~0)) (and .cse4 .cse1 .cse3 .cse5) (not (= 0 |old(~a25~0)|)) (and .cse0 (<= ~a19~0 0) .cse6) (not (= 1 |old(~a19~0)|)) (and (not (= ~a28~0 0)) (= ~a17~0 8) .cse7) (and .cse4 .cse6 .cse5 (<= 1 ~a19~0)) (not (= 8 |old(~a17~0)|))))) [2018-12-03 02:56:50,697 INFO L448 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2018-12-03 02:56:50,697 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-12-03 02:56:50,697 INFO L444 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse9 (= ~a19~0 1))) (let ((.cse2 (not (= ~a25~0 1))) (.cse1 (not .cse9)) (.cse3 (not (= ~a11~0 1))) (.cse4 (= 8 ~a17~0)) (.cse5 (= 1 ~a19~0)) (.cse0 (<= ~a17~0 7)) (.cse6 (<= ~a17~0 |old(~a17~0)|)) (.cse8 (= 1 ~a25~0)) (.cse7 (not (= ~a28~0 9)))) (or (and .cse0 (<= 10 ~a28~0)) (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (and .cse1 .cse0 .cse2 .cse3) (not (= 0 |old(~a11~0)|)) (and (= 7 ~a28~0) .cse2 .cse4 (not .cse5)) (and .cse6 .cse1 .cse3 .cse7) (and (= 1 ~a11~0) .cse8 .cse4 .cse5) (and (not (= main_~input~0 0)) (not (= ~a28~0 0)) (= ~a17~0 8) .cse9) (not (= 0 |old(~a25~0)|)) (and .cse0 (<= ~a19~0 0) .cse8) (not (= 1 |old(~a19~0)|)) (and .cse6 .cse8 .cse7 (<= 1 ~a19~0)) (not (= 8 |old(~a17~0)|))))) [2018-12-03 02:56:50,697 INFO L448 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-12-03 02:56:50,697 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-12-03 02:56:50,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:56:50 BoogieIcfgContainer [2018-12-03 02:56:50,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:56:50,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:56:50,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:56:50,707 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:56:50,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:56:34" (3/4) ... [2018-12-03 02:56:50,710 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 02:56:50,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 02:56:50,715 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-03 02:56:50,716 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 02:56:50,724 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-03 02:56:50,725 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 02:56:50,748 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((a17 <= 7 && 10 <= a28) || !(1 == a21)) || !(7 == \old(a28))) || (((!(a19 == 1) && a17 <= 7) && !(a25 == 1)) && !(a11 == 1))) || !(0 == \old(a11))) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || (((a17 <= \old(a17) && !(a19 == 1)) && !(a11 == 1)) && !(a28 == 9))) || !(0 == \old(a25))) || ((a17 <= 7 && a19 <= 0) && 1 == a25)) || !(1 == \old(a19))) || ((!(a28 == 0) && a17 == 8) && a19 == 1)) || (((a17 <= \old(a17) && 1 == a25) && !(a28 == 9)) && 1 <= a19)) || !(8 == \old(a17)) [2018-12-03 02:56:50,809 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_870a9694-3df7-43e0-9bdf-40873c9e38cc/bin-2019/utaipan/witness.graphml [2018-12-03 02:56:50,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:56:50,810 INFO L168 Benchmark]: Toolchain (without parser) took 17691.06 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 995.1 MB). Free memory was 947.0 MB in the beginning and 1.7 GB in the end (delta: -707.6 MB). Peak memory consumption was 287.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,810 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: Boogie Preprocessor took 36.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: RCFGBuilder took 577.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: TraceAbstraction took 16647.60 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 990.4 MB in the beginning and 1.7 GB in the end (delta: -687.2 MB). Peak memory consumption was 907.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,811 INFO L168 Benchmark]: Witness Printer took 102.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:50,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 577.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16647.60 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 990.4 MB in the beginning and 1.7 GB in the end (delta: -687.2 MB). Peak memory consumption was 907.7 MB. Max. memory is 11.5 GB. * Witness Printer took 102.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a17 <= 7 && 10 <= a28) || !(1 == a21)) || !(7 == \old(a28))) || (((!(a19 == 1) && a17 <= 7) && !(a25 == 1)) && !(a11 == 1))) || !(0 == \old(a11))) || ((7 == a28 && !(a25 == 1)) && 8 == a17)) || (((a17 <= \old(a17) && !(a19 == 1)) && !(a11 == 1)) && !(a28 == 9))) || !(0 == \old(a25))) || ((a17 <= 7 && a19 <= 0) && 1 == a25)) || !(1 == \old(a19))) || ((!(a28 == 0) && a17 == 8) && a19 == 1)) || (((a17 <= \old(a17) && 1 == a25) && !(a28 == 9)) && 1 <= a19)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 16.5s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1161 SDtfs, 6037 SDslu, 906 SDs, 0 SdLazy, 10903 SolverSat, 1520 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1441 GetRequests, 1324 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3021occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.997615502892715 AbsIntWeakeningRatio, 0.1683673469387755 AbsIntAvgWeakeningVarsNumRemoved, 26.288265306122447 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 652 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 158 PreInvPairs, 274 NumberOfFragments, 776 HoareAnnotationTreeSize, 158 FomulaSimplifications, 7786 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3972 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2962 ConstructedInterpolants, 0 QuantifiedInterpolants, 2221749 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1011 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 1285/1416 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...