./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.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_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/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 6e01bd719f7d1aae569b8a22e5c701b53d00d960 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:14:49,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:14:49,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:14:49,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:14:49,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:14:49,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:14:49,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:14:49,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:14:49,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:14:49,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:14:49,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:14:49,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:14:49,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:14:49,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:14:49,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:14:49,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:14:49,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:14:49,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:14:49,387 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:14:49,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:14:49,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:14:49,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:14:49,390 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:14:49,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:14:49,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:14:49,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:14:49,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:14:49,391 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:14:49,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:14:49,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:14:49,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:14:49,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:14:49,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:14:49,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:14:49,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:14:49,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:14:49,394 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:14:49,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:14:49,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:14:49,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:14:49,402 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:14:49,402 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:14:49,402 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:14:49,402 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:14:49,402 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:14:49,402 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:14:49,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:14:49,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:14:49,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:14:49,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:14:49,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:14:49,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:14:49,405 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_b663d4c9-95b1-4b09-8911-517135de47b0/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 -> 6e01bd719f7d1aae569b8a22e5c701b53d00d960 [2018-12-02 09:14:49,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:14:49,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:14:49,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:14:49,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:14:49,432 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:14:49,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 09:14:49,465 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/data/5ee995f49/29114404d049489090040c160cd65273/FLAG2328d1a73 [2018-12-02 09:14:49,893 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:14:49,893 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/sv-benchmarks/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 09:14:49,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/data/5ee995f49/29114404d049489090040c160cd65273/FLAG2328d1a73 [2018-12-02 09:14:49,907 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/data/5ee995f49/29114404d049489090040c160cd65273 [2018-12-02 09:14:49,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:14:49,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:14:49,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:14:49,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:14:49,913 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:14:49,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:14:49" (1/1) ... [2018-12-02 09:14:49,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f41b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:49, skipping insertion in model container [2018-12-02 09:14:49,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:14:49" (1/1) ... [2018-12-02 09:14:49,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:14:49,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:14:50,065 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:14:50,067 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:14:50,100 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:14:50,139 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:14:50,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50 WrapperNode [2018-12-02 09:14:50,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:14:50,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:14:50,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:14:50,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:14:50,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:14:50,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:14:50,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:14:50,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:14:50,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... [2018-12-02 09:14:50,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:14:50,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:14:50,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:14:50,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:14:50,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:14:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:14:50,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:14:50,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:14:50,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:14:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:14:50,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:14:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 09:14:50,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 09:14:50,297 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 09:14:50,297 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 09:14:50,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:14:50,556 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 09:14:50,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:50 BoogieIcfgContainer [2018-12-02 09:14:50,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:14:50,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:14:50,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:14:50,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:14:50,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:14:49" (1/3) ... [2018-12-02 09:14:50,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ccceab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:14:50, skipping insertion in model container [2018-12-02 09:14:50,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:14:50" (2/3) ... [2018-12-02 09:14:50,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ccceab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:14:50, skipping insertion in model container [2018-12-02 09:14:50,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:50" (3/3) ... [2018-12-02 09:14:50,563 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-02 09:14:50,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:14:50,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:14:50,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:14:50,609 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:14:50,609 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:14:50,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:14:50,610 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:14:50,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:14:50,610 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:14:50,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:14:50,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:14:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-12-02 09:14:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 09:14:50,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:50,633 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] [2018-12-02 09:14:50,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:50,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash -459257302, now seen corresponding path program 1 times [2018-12-02 09:14:50,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:50,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:50,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:50,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:50,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:50,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:50,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:50,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:50,841 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-12-02 09:14:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:51,035 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2018-12-02 09:14:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:51,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 09:14:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:51,044 INFO L225 Difference]: With dead ends: 332 [2018-12-02 09:14:51,044 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 09:14:51,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 09:14:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-12-02 09:14:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-02 09:14:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2018-12-02 09:14:51,078 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 49 [2018-12-02 09:14:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:51,078 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2018-12-02 09:14:51,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2018-12-02 09:14:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 09:14:51,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:51,080 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] [2018-12-02 09:14:51,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:51,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1359139796, now seen corresponding path program 1 times [2018-12-02 09:14:51,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:51,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:51,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:51,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:51,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:51,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:51,145 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 5 states. [2018-12-02 09:14:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:51,311 INFO L93 Difference]: Finished difference Result 377 states and 621 transitions. [2018-12-02 09:14:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:51,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 09:14:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:51,312 INFO L225 Difference]: With dead ends: 377 [2018-12-02 09:14:51,312 INFO L226 Difference]: Without dead ends: 217 [2018-12-02 09:14:51,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-02 09:14:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2018-12-02 09:14:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-02 09:14:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2018-12-02 09:14:51,327 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 50 [2018-12-02 09:14:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:51,327 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2018-12-02 09:14:51,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2018-12-02 09:14:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 09:14:51,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:51,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:51,330 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:51,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:51,330 INFO L82 PathProgramCache]: Analyzing trace with hash -250817147, now seen corresponding path program 1 times [2018-12-02 09:14:51,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:51,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:51,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:51,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:51,425 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand 5 states. [2018-12-02 09:14:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:51,540 INFO L93 Difference]: Finished difference Result 442 states and 747 transitions. [2018-12-02 09:14:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:51,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-02 09:14:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:51,542 INFO L225 Difference]: With dead ends: 442 [2018-12-02 09:14:51,542 INFO L226 Difference]: Without dead ends: 243 [2018-12-02 09:14:51,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-02 09:14:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-02 09:14:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-02 09:14:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 409 transitions. [2018-12-02 09:14:51,557 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 409 transitions. Word has length 77 [2018-12-02 09:14:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:51,557 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 409 transitions. [2018-12-02 09:14:51,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 409 transitions. [2018-12-02 09:14:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 09:14:51,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:51,559 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:51,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:51,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash -508376229, now seen corresponding path program 1 times [2018-12-02 09:14:51,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:51,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:51,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:51,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:51,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:51,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:51,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:51,607 INFO L87 Difference]: Start difference. First operand 243 states and 409 transitions. Second operand 5 states. [2018-12-02 09:14:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:51,697 INFO L93 Difference]: Finished difference Result 490 states and 829 transitions. [2018-12-02 09:14:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:51,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 09:14:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:51,698 INFO L225 Difference]: With dead ends: 490 [2018-12-02 09:14:51,699 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 09:14:51,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 09:14:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-12-02 09:14:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-12-02 09:14:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 432 transitions. [2018-12-02 09:14:51,708 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 432 transitions. Word has length 89 [2018-12-02 09:14:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:51,708 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 432 transitions. [2018-12-02 09:14:51,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 432 transitions. [2018-12-02 09:14:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 09:14:51,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:51,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:51,709 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:51,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 384668356, now seen corresponding path program 1 times [2018-12-02 09:14:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:51,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:51,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:51,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:51,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:51,757 INFO L87 Difference]: Start difference. First operand 258 states and 432 transitions. Second operand 5 states. [2018-12-02 09:14:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:51,909 INFO L93 Difference]: Finished difference Result 549 states and 928 transitions. [2018-12-02 09:14:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:51,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 09:14:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:51,910 INFO L225 Difference]: With dead ends: 549 [2018-12-02 09:14:51,910 INFO L226 Difference]: Without dead ends: 304 [2018-12-02 09:14:51,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-02 09:14:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2018-12-02 09:14:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-02 09:14:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 506 transitions. [2018-12-02 09:14:51,917 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 506 transitions. Word has length 89 [2018-12-02 09:14:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 506 transitions. [2018-12-02 09:14:51,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 506 transitions. [2018-12-02 09:14:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 09:14:51,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:51,918 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:51,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:51,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1150340194, now seen corresponding path program 1 times [2018-12-02 09:14:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:51,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:51,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:51,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:51,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:51,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:51,957 INFO L87 Difference]: Start difference. First operand 300 states and 506 transitions. Second operand 5 states. [2018-12-02 09:14:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,054 INFO L93 Difference]: Finished difference Result 589 states and 997 transitions. [2018-12-02 09:14:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-02 09:14:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,055 INFO L225 Difference]: With dead ends: 589 [2018-12-02 09:14:52,055 INFO L226 Difference]: Without dead ends: 302 [2018-12-02 09:14:52,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-02 09:14:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-12-02 09:14:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-02 09:14:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 502 transitions. [2018-12-02 09:14:52,066 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 502 transitions. Word has length 90 [2018-12-02 09:14:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,067 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 502 transitions. [2018-12-02 09:14:52,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 502 transitions. [2018-12-02 09:14:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 09:14:52,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,068 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:52,068 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 12513126, now seen corresponding path program 1 times [2018-12-02 09:14:52,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:14:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,105 INFO L87 Difference]: Start difference. First operand 300 states and 502 transitions. Second operand 5 states. [2018-12-02 09:14:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,227 INFO L93 Difference]: Finished difference Result 591 states and 992 transitions. [2018-12-02 09:14:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-02 09:14:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,229 INFO L225 Difference]: With dead ends: 591 [2018-12-02 09:14:52,229 INFO L226 Difference]: Without dead ends: 302 [2018-12-02 09:14:52,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-02 09:14:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-12-02 09:14:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-02 09:14:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 497 transitions. [2018-12-02 09:14:52,240 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 497 transitions. Word has length 90 [2018-12-02 09:14:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,240 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 497 transitions. [2018-12-02 09:14:52,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 497 transitions. [2018-12-02 09:14:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 09:14:52,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,241 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:52,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1256654058, now seen corresponding path program 1 times [2018-12-02 09:14:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 09:14:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,273 INFO L87 Difference]: Start difference. First operand 298 states and 497 transitions. Second operand 5 states. [2018-12-02 09:14:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,378 INFO L93 Difference]: Finished difference Result 591 states and 988 transitions. [2018-12-02 09:14:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 09:14:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,379 INFO L225 Difference]: With dead ends: 591 [2018-12-02 09:14:52,379 INFO L226 Difference]: Without dead ends: 306 [2018-12-02 09:14:52,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-02 09:14:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-02 09:14:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-02 09:14:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2018-12-02 09:14:52,386 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 101 [2018-12-02 09:14:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,387 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2018-12-02 09:14:52,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2018-12-02 09:14:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 09:14:52,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,388 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, 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] [2018-12-02 09:14:52,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash -315055682, now seen corresponding path program 1 times [2018-12-02 09:14:52,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:52,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,418 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 5 states. [2018-12-02 09:14:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,540 INFO L93 Difference]: Finished difference Result 630 states and 1040 transitions. [2018-12-02 09:14:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 09:14:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,541 INFO L225 Difference]: With dead ends: 630 [2018-12-02 09:14:52,541 INFO L226 Difference]: Without dead ends: 337 [2018-12-02 09:14:52,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-02 09:14:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-12-02 09:14:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-02 09:14:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2018-12-02 09:14:52,549 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 103 [2018-12-02 09:14:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,549 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2018-12-02 09:14:52,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2018-12-02 09:14:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 09:14:52,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,550 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:52,550 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1874973505, now seen corresponding path program 1 times [2018-12-02 09:14:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,585 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 5 states. [2018-12-02 09:14:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,706 INFO L93 Difference]: Finished difference Result 691 states and 1140 transitions. [2018-12-02 09:14:52,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-02 09:14:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,708 INFO L225 Difference]: With dead ends: 691 [2018-12-02 09:14:52,708 INFO L226 Difference]: Without dead ends: 369 [2018-12-02 09:14:52,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-02 09:14:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-12-02 09:14:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 09:14:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 591 transitions. [2018-12-02 09:14:52,718 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 591 transitions. Word has length 104 [2018-12-02 09:14:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,719 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 591 transitions. [2018-12-02 09:14:52,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 591 transitions. [2018-12-02 09:14:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 09:14:52,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,720 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, 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] [2018-12-02 09:14:52,720 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -411681051, now seen corresponding path program 1 times [2018-12-02 09:14:52,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:52,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,761 INFO L87 Difference]: Start difference. First operand 362 states and 591 transitions. Second operand 5 states. [2018-12-02 09:14:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:52,892 INFO L93 Difference]: Finished difference Result 713 states and 1167 transitions. [2018-12-02 09:14:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:52,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-02 09:14:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:52,894 INFO L225 Difference]: With dead ends: 713 [2018-12-02 09:14:52,894 INFO L226 Difference]: Without dead ends: 364 [2018-12-02 09:14:52,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-02 09:14:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-12-02 09:14:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 09:14:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2018-12-02 09:14:52,904 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 104 [2018-12-02 09:14:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:52,904 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2018-12-02 09:14:52,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2018-12-02 09:14:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 09:14:52,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:52,905 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, 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] [2018-12-02 09:14:52,905 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:52,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1317457818, now seen corresponding path program 1 times [2018-12-02 09:14:52,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:52,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 09:14:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:52,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:52,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:52,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:52,957 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 5 states. [2018-12-02 09:14:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:53,076 INFO L93 Difference]: Finished difference Result 718 states and 1169 transitions. [2018-12-02 09:14:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:53,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 09:14:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:53,077 INFO L225 Difference]: With dead ends: 718 [2018-12-02 09:14:53,077 INFO L226 Difference]: Without dead ends: 369 [2018-12-02 09:14:53,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-02 09:14:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-12-02 09:14:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 09:14:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2018-12-02 09:14:53,090 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 105 [2018-12-02 09:14:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:53,091 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2018-12-02 09:14:53,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2018-12-02 09:14:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 09:14:53,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:53,092 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:53,092 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:53,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash -817214863, now seen corresponding path program 1 times [2018-12-02 09:14:53,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 09:14:53,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:53,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:53,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:53,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:53,130 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 5 states. [2018-12-02 09:14:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:53,235 INFO L93 Difference]: Finished difference Result 736 states and 1188 transitions. [2018-12-02 09:14:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:53,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-02 09:14:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:53,237 INFO L225 Difference]: With dead ends: 736 [2018-12-02 09:14:53,237 INFO L226 Difference]: Without dead ends: 387 [2018-12-02 09:14:53,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-02 09:14:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-12-02 09:14:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-02 09:14:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2018-12-02 09:14:53,245 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 110 [2018-12-02 09:14:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:53,246 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2018-12-02 09:14:53,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2018-12-02 09:14:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 09:14:53,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:53,246 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:53,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:53,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1429215766, now seen corresponding path program 1 times [2018-12-02 09:14:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-02 09:14:53,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:53,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:53,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:53,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:53,274 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 5 states. [2018-12-02 09:14:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:53,387 INFO L93 Difference]: Finished difference Result 757 states and 1211 transitions. [2018-12-02 09:14:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:53,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 09:14:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:53,389 INFO L225 Difference]: With dead ends: 757 [2018-12-02 09:14:53,389 INFO L226 Difference]: Without dead ends: 387 [2018-12-02 09:14:53,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-02 09:14:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-12-02 09:14:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-02 09:14:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2018-12-02 09:14:53,397 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 111 [2018-12-02 09:14:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:53,398 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2018-12-02 09:14:53,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2018-12-02 09:14:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 09:14:53,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:53,399 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:53,399 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:53,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1449286990, now seen corresponding path program 1 times [2018-12-02 09:14:53,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:53,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 09:14:53,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:53,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:53,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:53,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:53,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:53,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:53,421 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2018-12-02 09:14:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:53,455 INFO L93 Difference]: Finished difference Result 753 states and 1193 transitions. [2018-12-02 09:14:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:53,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-12-02 09:14:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:53,458 INFO L225 Difference]: With dead ends: 753 [2018-12-02 09:14:53,458 INFO L226 Difference]: Without dead ends: 751 [2018-12-02 09:14:53,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-12-02 09:14:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2018-12-02 09:14:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-02 09:14:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1191 transitions. [2018-12-02 09:14:53,484 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1191 transitions. Word has length 126 [2018-12-02 09:14:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:53,484 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1191 transitions. [2018-12-02 09:14:53,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1191 transitions. [2018-12-02 09:14:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 09:14:53,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:53,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:53,487 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1360581389, now seen corresponding path program 1 times [2018-12-02 09:14:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:53,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:53,494 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 09:14:53,494 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 09:14:53,495 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 09:14:53,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:53,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 09:14:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:53,530 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-12-02 09:14:53,531 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [93], [98], [103], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:53,555 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:53,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:53,657 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:14:53,658 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 3. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 84 variables. [2018-12-02 09:14:53,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:53,666 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:14:53,754 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 81.01% of their original sizes. [2018-12-02 09:14:53,754 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:14:53,776 INFO L418 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-12-02 09:14:53,776 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:14:53,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:14:53,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:53,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:14:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:14:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:14:53,777 INFO L87 Difference]: Start difference. First operand 751 states and 1191 transitions. Second operand 5 states. [2018-12-02 09:14:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:54,052 INFO L93 Difference]: Finished difference Result 1502 states and 2385 transitions. [2018-12-02 09:14:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:54,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-02 09:14:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:54,054 INFO L225 Difference]: With dead ends: 1502 [2018-12-02 09:14:54,054 INFO L226 Difference]: Without dead ends: 764 [2018-12-02 09:14:54,055 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-12-02 09:14:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-12-02 09:14:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-02 09:14:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1204 transitions. [2018-12-02 09:14:54,082 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1204 transitions. Word has length 127 [2018-12-02 09:14:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:54,082 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 1204 transitions. [2018-12-02 09:14:54,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:14:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1204 transitions. [2018-12-02 09:14:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 09:14:54,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:54,083 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:54,084 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:54,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1941520082, now seen corresponding path program 1 times [2018-12-02 09:14:54,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 09:14:54,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:54,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:54,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:54,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,113 INFO L87 Difference]: Start difference. First operand 764 states and 1204 transitions. Second operand 3 states. [2018-12-02 09:14:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:54,221 INFO L93 Difference]: Finished difference Result 1510 states and 2390 transitions. [2018-12-02 09:14:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:54,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-12-02 09:14:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:54,224 INFO L225 Difference]: With dead ends: 1510 [2018-12-02 09:14:54,224 INFO L226 Difference]: Without dead ends: 772 [2018-12-02 09:14:54,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-02 09:14:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2018-12-02 09:14:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-02 09:14:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1186 transitions. [2018-12-02 09:14:54,259 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1186 transitions. Word has length 143 [2018-12-02 09:14:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:54,259 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 1186 transitions. [2018-12-02 09:14:54,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1186 transitions. [2018-12-02 09:14:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 09:14:54,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:54,262 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:54,262 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:54,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1426466207, now seen corresponding path program 1 times [2018-12-02 09:14:54,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:54,276 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 09:14:54,277 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 09:14:54,277 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 09:14:54,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 09:14:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:54,313 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-02 09:14:54,313 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:54,315 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:54,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:54,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:54,435 INFO L272 AbstractInterpreter]: Visited 73 different actions 169 times. Merged at 56 different actions 89 times. Never widened. Performed 812 root evaluator evaluations with a maximum evaluation depth of 8. Performed 812 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 8 fixpoints after 8 different actions. Largest state had 86 variables. [2018-12-02 09:14:54,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:54,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:54,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:54,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:54,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:54,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 09:14:54,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 09:14:54,552 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:54,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-02 09:14:54,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:54,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,553 INFO L87 Difference]: Start difference. First operand 764 states and 1186 transitions. Second operand 3 states. [2018-12-02 09:14:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:54,604 INFO L93 Difference]: Finished difference Result 1870 states and 2919 transitions. [2018-12-02 09:14:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:54,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-02 09:14:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:54,608 INFO L225 Difference]: With dead ends: 1870 [2018-12-02 09:14:54,608 INFO L226 Difference]: Without dead ends: 1132 [2018-12-02 09:14:54,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-12-02 09:14:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2018-12-02 09:14:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-02 09:14:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1762 transitions. [2018-12-02 09:14:54,637 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1762 transitions. Word has length 164 [2018-12-02 09:14:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:54,637 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1762 transitions. [2018-12-02 09:14:54,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1762 transitions. [2018-12-02 09:14:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-02 09:14:54,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:54,639 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-12-02 09:14:54,639 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:54,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash -391989381, now seen corresponding path program 1 times [2018-12-02 09:14:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:54,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 09:14:54,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:54,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:54,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:54,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:54,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,679 INFO L87 Difference]: Start difference. First operand 1132 states and 1762 transitions. Second operand 3 states. [2018-12-02 09:14:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:54,828 INFO L93 Difference]: Finished difference Result 2265 states and 3527 transitions. [2018-12-02 09:14:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:54,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-02 09:14:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:54,830 INFO L225 Difference]: With dead ends: 2265 [2018-12-02 09:14:54,830 INFO L226 Difference]: Without dead ends: 1159 [2018-12-02 09:14:54,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-12-02 09:14:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1132. [2018-12-02 09:14:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-02 09:14:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1708 transitions. [2018-12-02 09:14:54,858 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1708 transitions. Word has length 204 [2018-12-02 09:14:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:54,858 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1708 transitions. [2018-12-02 09:14:54,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1708 transitions. [2018-12-02 09:14:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 09:14:54,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:54,860 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-12-02 09:14:54,860 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -945704107, now seen corresponding path program 1 times [2018-12-02 09:14:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:54,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-12-02 09:14:54,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:54,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:54,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:54,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:54,890 INFO L87 Difference]: Start difference. First operand 1132 states and 1708 transitions. Second operand 3 states. [2018-12-02 09:14:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:55,048 INFO L93 Difference]: Finished difference Result 2276 states and 3430 transitions. [2018-12-02 09:14:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:55,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-02 09:14:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:55,051 INFO L225 Difference]: With dead ends: 2276 [2018-12-02 09:14:55,051 INFO L226 Difference]: Without dead ends: 1170 [2018-12-02 09:14:55,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-02 09:14:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1132. [2018-12-02 09:14:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-02 09:14:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1666 transitions. [2018-12-02 09:14:55,098 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1666 transitions. Word has length 217 [2018-12-02 09:14:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:55,098 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1666 transitions. [2018-12-02 09:14:55,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1666 transitions. [2018-12-02 09:14:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-02 09:14:55,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:55,102 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-02 09:14:55,102 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:55,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1110401752, now seen corresponding path program 1 times [2018-12-02 09:14:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:55,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:55,112 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 09:14:55,112 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 09:14:55,112 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 09:14:55,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 09:14:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:55,163 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-12-02 09:14:55,163 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:55,164 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:55,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:55,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:55,317 INFO L272 AbstractInterpreter]: Visited 78 different actions 246 times. Merged at 63 different actions 153 times. Widened at 2 different actions 2 times. Performed 1051 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1051 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 18 fixpoints after 12 different actions. Largest state had 86 variables. [2018-12-02 09:14:55,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:55,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:55,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:55,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:55,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 09:14:55,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-02 09:14:55,449 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:55,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-02 09:14:55,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:55,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:55,450 INFO L87 Difference]: Start difference. First operand 1132 states and 1666 transitions. Second operand 3 states. [2018-12-02 09:14:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:55,513 INFO L93 Difference]: Finished difference Result 3332 states and 4926 transitions. [2018-12-02 09:14:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:55,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-12-02 09:14:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:55,517 INFO L225 Difference]: With dead ends: 3332 [2018-12-02 09:14:55,517 INFO L226 Difference]: Without dead ends: 2226 [2018-12-02 09:14:55,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-12-02 09:14:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2224. [2018-12-02 09:14:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-02 09:14:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3280 transitions. [2018-12-02 09:14:55,571 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3280 transitions. Word has length 246 [2018-12-02 09:14:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:55,571 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 3280 transitions. [2018-12-02 09:14:55,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3280 transitions. [2018-12-02 09:14:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 09:14:55,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:55,574 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-02 09:14:55,575 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:55,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1423055184, now seen corresponding path program 1 times [2018-12-02 09:14:55,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:55,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:55,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:55,582 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 09:14:55,582 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 09:14:55,582 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 09:14:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 09:14:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:55,636 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-12-02 09:14:55,637 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:55,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:55,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:55,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:55,815 INFO L272 AbstractInterpreter]: Visited 80 different actions 295 times. Merged at 67 different actions 192 times. Widened at 4 different actions 5 times. Performed 1276 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 26 fixpoints after 13 different actions. Largest state had 86 variables. [2018-12-02 09:14:55,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:55,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:55,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:55,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:55,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:55,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:55,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-02 09:14:55,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-02 09:14:55,956 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:55,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-02 09:14:55,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:55,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:55,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:55,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:55,957 INFO L87 Difference]: Start difference. First operand 2224 states and 3280 transitions. Second operand 3 states. [2018-12-02 09:14:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:56,081 INFO L93 Difference]: Finished difference Result 4422 states and 6530 transitions. [2018-12-02 09:14:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:56,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-12-02 09:14:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:56,088 INFO L225 Difference]: With dead ends: 4422 [2018-12-02 09:14:56,089 INFO L226 Difference]: Without dead ends: 2224 [2018-12-02 09:14:56,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-12-02 09:14:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2224. [2018-12-02 09:14:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-02 09:14:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3214 transitions. [2018-12-02 09:14:56,145 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3214 transitions. Word has length 283 [2018-12-02 09:14:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:56,146 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 3214 transitions. [2018-12-02 09:14:56,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3214 transitions. [2018-12-02 09:14:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-02 09:14:56,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:56,150 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-02 09:14:56,150 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:56,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 464693141, now seen corresponding path program 1 times [2018-12-02 09:14:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:56,157 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 09:14:56,157 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 09:14:56,157 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 09:14:56,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:56,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 09:14:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:56,211 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-12-02 09:14:56,212 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [436], [438], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:56,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:56,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:56,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:56,357 INFO L272 AbstractInterpreter]: Visited 83 different actions 233 times. Merged at 66 different actions 134 times. Widened at 3 different actions 3 times. Performed 1046 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 20 fixpoints after 11 different actions. Largest state had 86 variables. [2018-12-02 09:14:56,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:56,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:56,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:56,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:56,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:56,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-02 09:14:56,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-02 09:14:56,528 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:56,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-12-02 09:14:56,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:56,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:14:56,529 INFO L87 Difference]: Start difference. First operand 2224 states and 3214 transitions. Second operand 3 states. [2018-12-02 09:14:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:56,681 INFO L93 Difference]: Finished difference Result 4656 states and 6764 transitions. [2018-12-02 09:14:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:56,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-12-02 09:14:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:56,684 INFO L225 Difference]: With dead ends: 4656 [2018-12-02 09:14:56,684 INFO L226 Difference]: Without dead ends: 1481 [2018-12-02 09:14:56,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:14:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-12-02 09:14:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2018-12-02 09:14:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-12-02 09:14:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2109 transitions. [2018-12-02 09:14:56,714 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2109 transitions. Word has length 311 [2018-12-02 09:14:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:56,715 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2109 transitions. [2018-12-02 09:14:56,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2109 transitions. [2018-12-02 09:14:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-02 09:14:56,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:56,716 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2018-12-02 09:14:56,717 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:56,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash -60637526, now seen corresponding path program 1 times [2018-12-02 09:14:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-12-02 09:14:56,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:56,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:56,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:56,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:56,756 INFO L87 Difference]: Start difference. First operand 1481 states and 2109 transitions. Second operand 3 states. [2018-12-02 09:14:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:56,867 INFO L93 Difference]: Finished difference Result 3017 states and 4306 transitions. [2018-12-02 09:14:56,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:56,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-12-02 09:14:56,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:56,871 INFO L225 Difference]: With dead ends: 3017 [2018-12-02 09:14:56,872 INFO L226 Difference]: Without dead ends: 1562 [2018-12-02 09:14:56,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-12-02 09:14:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1550. [2018-12-02 09:14:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2018-12-02 09:14:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2193 transitions. [2018-12-02 09:14:56,919 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2193 transitions. Word has length 312 [2018-12-02 09:14:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:56,919 INFO L480 AbstractCegarLoop]: Abstraction has 1550 states and 2193 transitions. [2018-12-02 09:14:56,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2193 transitions. [2018-12-02 09:14:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-02 09:14:56,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:56,923 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:56,923 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1485741080, now seen corresponding path program 1 times [2018-12-02 09:14:56,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:56,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:56,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-02 09:14:56,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:56,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:56,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:56,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:56,980 INFO L87 Difference]: Start difference. First operand 1550 states and 2193 transitions. Second operand 3 states. [2018-12-02 09:14:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:57,105 INFO L93 Difference]: Finished difference Result 3222 states and 4588 transitions. [2018-12-02 09:14:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:57,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-12-02 09:14:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:57,108 INFO L225 Difference]: With dead ends: 3222 [2018-12-02 09:14:57,109 INFO L226 Difference]: Without dead ends: 1698 [2018-12-02 09:14:57,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-12-02 09:14:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1650. [2018-12-02 09:14:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-12-02 09:14:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2313 transitions. [2018-12-02 09:14:57,144 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2313 transitions. Word has length 332 [2018-12-02 09:14:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:57,145 INFO L480 AbstractCegarLoop]: Abstraction has 1650 states and 2313 transitions. [2018-12-02 09:14:57,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2313 transitions. [2018-12-02 09:14:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-02 09:14:57,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:57,148 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2018-12-02 09:14:57,148 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:57,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 432297452, now seen corresponding path program 1 times [2018-12-02 09:14:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:57,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:57,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-12-02 09:14:57,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:57,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:57,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:57,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:57,243 INFO L87 Difference]: Start difference. First operand 1650 states and 2313 transitions. Second operand 3 states. [2018-12-02 09:14:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:57,350 INFO L93 Difference]: Finished difference Result 3302 states and 4644 transitions. [2018-12-02 09:14:57,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:57,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2018-12-02 09:14:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:57,354 INFO L225 Difference]: With dead ends: 3302 [2018-12-02 09:14:57,354 INFO L226 Difference]: Without dead ends: 1678 [2018-12-02 09:14:57,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-12-02 09:14:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1650. [2018-12-02 09:14:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-12-02 09:14:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2273 transitions. [2018-12-02 09:14:57,384 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2273 transitions. Word has length 358 [2018-12-02 09:14:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 1650 states and 2273 transitions. [2018-12-02 09:14:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2273 transitions. [2018-12-02 09:14:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-02 09:14:57,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:57,386 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:57,386 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:57,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 222053756, now seen corresponding path program 1 times [2018-12-02 09:14:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:57,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-02 09:14:57,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:57,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:14:57,445 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-12-02 09:14:57,445 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:57,446 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:57,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:57,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:57,602 INFO L272 AbstractInterpreter]: Visited 97 different actions 309 times. Merged at 81 different actions 190 times. Widened at 2 different actions 2 times. Performed 1338 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1338 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 29 fixpoints after 15 different actions. Largest state had 88 variables. [2018-12-02 09:14:57,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:57,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:57,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:57,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:57,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:57,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:57,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-02 09:14:57,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-02 09:14:57,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:14:57,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 09:14:57,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:14:57,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:14:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:14:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:57,810 INFO L87 Difference]: Start difference. First operand 1650 states and 2273 transitions. Second operand 4 states. [2018-12-02 09:14:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:58,008 INFO L93 Difference]: Finished difference Result 4838 states and 6667 transitions. [2018-12-02 09:14:58,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:14:58,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-12-02 09:14:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:58,013 INFO L225 Difference]: With dead ends: 4838 [2018-12-02 09:14:58,013 INFO L226 Difference]: Without dead ends: 3118 [2018-12-02 09:14:58,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:14:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2018-12-02 09:14:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 1735. [2018-12-02 09:14:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-02 09:14:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2368 transitions. [2018-12-02 09:14:58,052 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2368 transitions. Word has length 375 [2018-12-02 09:14:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:58,053 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2368 transitions. [2018-12-02 09:14:58,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:14:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2368 transitions. [2018-12-02 09:14:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-12-02 09:14:58,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:58,056 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2018-12-02 09:14:58,056 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:58,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1893965958, now seen corresponding path program 1 times [2018-12-02 09:14:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-12-02 09:14:58,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:58,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:58,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:58,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:58,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:58,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,125 INFO L87 Difference]: Start difference. First operand 1735 states and 2368 transitions. Second operand 3 states. [2018-12-02 09:14:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:58,245 INFO L93 Difference]: Finished difference Result 3452 states and 4714 transitions. [2018-12-02 09:14:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:58,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2018-12-02 09:14:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:58,250 INFO L225 Difference]: With dead ends: 3452 [2018-12-02 09:14:58,250 INFO L226 Difference]: Without dead ends: 1743 [2018-12-02 09:14:58,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-12-02 09:14:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1735. [2018-12-02 09:14:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-02 09:14:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2328 transitions. [2018-12-02 09:14:58,293 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2328 transitions. Word has length 443 [2018-12-02 09:14:58,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:58,293 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2328 transitions. [2018-12-02 09:14:58,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2328 transitions. [2018-12-02 09:14:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-12-02 09:14:58,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:58,296 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2018-12-02 09:14:58,296 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:58,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash 756608049, now seen corresponding path program 1 times [2018-12-02 09:14:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:58,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-12-02 09:14:58,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:58,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:58,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:58,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:58,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:58,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,412 INFO L87 Difference]: Start difference. First operand 1735 states and 2328 transitions. Second operand 3 states. [2018-12-02 09:14:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:58,560 INFO L93 Difference]: Finished difference Result 3588 states and 4838 transitions. [2018-12-02 09:14:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:58,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2018-12-02 09:14:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:58,564 INFO L225 Difference]: With dead ends: 3588 [2018-12-02 09:14:58,564 INFO L226 Difference]: Without dead ends: 1879 [2018-12-02 09:14:58,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-12-02 09:14:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1871. [2018-12-02 09:14:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2018-12-02 09:14:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2484 transitions. [2018-12-02 09:14:58,601 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2484 transitions. Word has length 475 [2018-12-02 09:14:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:58,601 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 2484 transitions. [2018-12-02 09:14:58,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2484 transitions. [2018-12-02 09:14:58,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-12-02 09:14:58,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:58,603 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:58,603 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:58,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:58,603 INFO L82 PathProgramCache]: Analyzing trace with hash -10886553, now seen corresponding path program 1 times [2018-12-02 09:14:58,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2018-12-02 09:14:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:14:58,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:14:58,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:14:58,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:14:58,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:14:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,694 INFO L87 Difference]: Start difference. First operand 1871 states and 2484 transitions. Second operand 3 states. [2018-12-02 09:14:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:58,833 INFO L93 Difference]: Finished difference Result 3868 states and 5166 transitions. [2018-12-02 09:14:58,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:14:58,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2018-12-02 09:14:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:58,837 INFO L225 Difference]: With dead ends: 3868 [2018-12-02 09:14:58,837 INFO L226 Difference]: Without dead ends: 2023 [2018-12-02 09:14:58,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:14:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-02 09:14:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2015. [2018-12-02 09:14:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2018-12-02 09:14:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2648 transitions. [2018-12-02 09:14:58,894 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2648 transitions. Word has length 537 [2018-12-02 09:14:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:58,894 INFO L480 AbstractCegarLoop]: Abstraction has 2015 states and 2648 transitions. [2018-12-02 09:14:58,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:14:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2648 transitions. [2018-12-02 09:14:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-02 09:14:58,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:14:58,898 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:14:58,899 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:14:58,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1755141137, now seen corresponding path program 1 times [2018-12-02 09:14:58,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:14:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:58,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:14:58,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:14:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-02 09:14:59,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:59,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:14:59,054 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 604 with the following transitions: [2018-12-02 09:14:59,054 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [440], [445], [450], [455], [458], [463], [465], [470], [472], [475], [477], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-02 09:14:59,055 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:14:59,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:14:59,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:14:59,216 INFO L272 AbstractInterpreter]: Visited 109 different actions 348 times. Merged at 89 different actions 209 times. Widened at 2 different actions 2 times. Performed 1586 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 41 fixpoints after 19 different actions. Largest state had 93 variables. [2018-12-02 09:14:59,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:14:59,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:14:59,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:14:59,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:14:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:14:59,230 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:14:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:14:59,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:14:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-02 09:14:59,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:14:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-02 09:14:59,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:14:59,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 09:14:59,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:14:59,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:14:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:14:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:14:59,539 INFO L87 Difference]: Start difference. First operand 2015 states and 2648 transitions. Second operand 4 states. [2018-12-02 09:14:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:14:59,639 INFO L93 Difference]: Finished difference Result 2675 states and 3517 transitions. [2018-12-02 09:14:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:14:59,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2018-12-02 09:14:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:14:59,639 INFO L225 Difference]: With dead ends: 2675 [2018-12-02 09:14:59,639 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 09:14:59,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:14:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 09:14:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 09:14:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 09:14:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 09:14:59,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2018-12-02 09:14:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:14:59,642 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:14:59,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:14:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:14:59,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 09:14:59,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 09:14:59,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:14:59,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 09:15:00,194 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-02 09:15:00,380 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2018-12-02 09:15:00,521 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-12-02 09:15:00,657 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2018-12-02 09:15:00,809 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-02 09:15:01,052 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-02 09:15:01,275 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-02 09:15:01,570 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 51 [2018-12-02 09:15:01,715 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-02 09:15:01,857 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-02 09:15:02,012 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-02 09:15:02,152 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-02 09:15:02,306 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 24 [2018-12-02 09:15:02,527 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-02 09:15:02,664 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-12-02 09:15:02,863 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-12-02 09:15:02,986 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-12-02 09:15:03,295 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2018-12-02 09:15:03,446 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-02 09:15:03,448 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 09:15:03,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:15:03,448 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 09:15:03,448 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 09:15:03,449 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 675 686) the Hoare annotation is: true [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 675 686) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L444 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: (= main_~s~0 8464) [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point L682-1(line 682) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 675 686) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L444 ceAbstractionStarter]: At program point L201(lines 197 592) the Hoare annotation is: (or (and (<= 8672 ssl3_accept_~s__state~0) (<= ssl3_accept_~blastFlag~0 3) (not (= 12292 ssl3_accept_~s__state~0))) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-02 09:15:03,449 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 624) the Hoare annotation is: (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and (not (= 8673 ssl3_accept_~s__state~0)) (<= 8672 ssl3_accept_~s__state~0) (not (= 8672 ssl3_accept_~s__state~0)) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)))) [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point L500-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,449 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 590) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 601) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 612) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 623) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L444 ceAbstractionStarter]: At program point L204(lines 203 590) the Hoare annotation is: (or (not (= 8672 ssl3_accept_~s__state~0)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-02 09:15:03,450 INFO L444 ceAbstractionStarter]: At program point L171(lines 167 602) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-02 09:15:03,450 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 613) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ssl3_accept_~s__state~0))) (.cse5 (not (= 8480 ssl3_accept_~s__state~0))) (.cse6 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (not (= 8672 ssl3_accept_~s__state~0)) .cse2 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (and .cse0 .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~s__state~0 8576)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2018-12-02 09:15:03,450 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 600) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 611) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 622) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 589) the Hoare annotation is: (or (not (= 8672 ssl3_accept_~s__state~0)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2018-12-02 09:15:03,451 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L444 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L340-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L451 ceAbstractionStarter]: At program point L671(lines 63 673) the Hoare annotation is: true [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L451 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 8 674) the Hoare annotation is: true [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 599) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 610) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 621) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2018-12-02 09:15:03,452 INFO L444 ceAbstractionStarter]: At program point L177(lines 173 600) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-02 09:15:03,453 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 611) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L444 ceAbstractionStarter]: At program point L211(lines 104 623) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 .cse1 (not (= 8673 ssl3_accept_~s__state~0)) .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 598) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 609) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 620) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 63 673) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 597) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 608) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 619) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2018-12-02 09:15:03,453 INFO L444 ceAbstractionStarter]: At program point L183(lines 179 598) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-02 09:15:03,454 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 609) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 596) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 607) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 618) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 588) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 588) no Hoare annotation was computed. [2018-12-02 09:15:03,454 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 619) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,454 INFO L444 ceAbstractionStarter]: At program point L550(lines 63 673) the Hoare annotation is: (not (= |ssl3_accept_#in~initial_state| 8464)) [2018-12-02 09:15:03,454 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 595) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 606) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 617) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 8 674) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L448 ceAbstractionStarter]: For program point L288-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,455 INFO L444 ceAbstractionStarter]: At program point L189(lines 185 596) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12))) [2018-12-02 09:15:03,455 INFO L444 ceAbstractionStarter]: At program point L156(lines 152 607) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,456 INFO L444 ceAbstractionStarter]: At program point L123(lines 122 617) the Hoare annotation is: (or (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8496 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L444 ceAbstractionStarter]: At program point L587(lines 98 655) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= ssl3_accept_~s__state~0 8448)) (<= ssl3_accept_~s__state~0 3) (and .cse1 (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) .cse2) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse2))) [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 594) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 605) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 616) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 8 674) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2018-12-02 09:15:03,456 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L451 ceAbstractionStarter]: At program point L656(lines 97 657) the Hoare annotation is: true [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 593) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 604) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 615) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L444 ceAbstractionStarter]: At program point L195(lines 191 594) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ssl3_accept_~s__state~0))) (.cse7 (not (= 8561 ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ssl3_accept_~s__state~0))) (.cse10 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 (not (= ssl3_accept_~s__hit~0 0)) .cse10) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-02 09:15:03,457 INFO L444 ceAbstractionStarter]: At program point L162(lines 158 605) the Hoare annotation is: (let ((.cse0 (and (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse2 (<= ssl3_accept_~s__state~0 8672) .cse3) (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L527-2(lines 208 586) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L444 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2018-12-02 09:15:03,457 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 592) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 603) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 614) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L444 ceAbstractionStarter]: At program point L98-2(lines 98 655) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= ssl3_accept_~s__state~0 8448)) (<= ssl3_accept_~s__state~0 3) (and .cse1 (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) .cse2) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse2))) [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-02 09:15:03,458 INFO L444 ceAbstractionStarter]: At program point L165(lines 164 603) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (= ssl3_accept_~s__state~0 8448))) (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0) (and .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse0) (not (= |ssl3_accept_#in~initial_state| 8464)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse0))) [2018-12-02 09:15:03,458 INFO L444 ceAbstractionStarter]: At program point L132(lines 125 616) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 591) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 602) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 613) no Hoare annotation was computed. [2018-12-02 09:15:03,458 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 624) no Hoare annotation was computed. [2018-12-02 09:15:03,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:15:03 BoogieIcfgContainer [2018-12-02 09:15:03,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:15:03,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:15:03,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:15:03,481 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:15:03,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:14:50" (3/4) ... [2018-12-02 09:15:03,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 09:15:03,487 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 09:15:03,487 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 09:15:03,487 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_accept [2018-12-02 09:15:03,494 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 09:15:03,494 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 09:15:03,495 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 8464) || ((((!(8673 == s__state) && 8672 <= s__state) && !(8672 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 8464) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0))) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || (((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) [2018-12-02 09:15:03,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-02 09:15:03,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8672 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || ((((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576)) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-02 09:15:03,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-02 09:15:03,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(8545 == s__state)) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (((((s__state <= 8576 && (((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448) || ((blastFlag <= 3 && !(s__hit == 0)) && s__state == 8448)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-02 09:15:03,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-02 09:15:03,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-02 09:15:03,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 8464) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) [2018-12-02 09:15:03,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-02 09:15:03,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(8672 == s__state) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(8672 == s__state) || !(\old(initial_state) == 8464) [2018-12-02 09:15:03,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 8464) [2018-12-02 09:15:03,557 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b663d4c9-95b1-4b09-8911-517135de47b0/bin-2019/utaipan/witness.graphml [2018-12-02 09:15:03,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:15:03,558 INFO L168 Benchmark]: Toolchain (without parser) took 13648.04 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -249.8 MB). Peak memory consumption was 830.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,558 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:15:03,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,558 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:15:03,559 INFO L168 Benchmark]: RCFGBuilder took 377.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,559 INFO L168 Benchmark]: TraceAbstraction took 12922.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 940.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,559 INFO L168 Benchmark]: Witness Printer took 76.78 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:15:03,560 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12922.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 940.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 76.78 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: 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: 387]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(8672 == s__state) || !(\old(initial_state) == 8464) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(8545 == s__state)) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (((((s__state <= 8576 && (((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || (((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 8464) || ((((!(8673 == s__state) && 8672 <= s__state) && !(8672 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 8464) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) || !(\old(initial_state) == 8464) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448) || ((blastFlag <= 3 && !(s__hit == 0)) && s__state == 8448)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) || !(\old(initial_state) == 8464) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 8464) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 8464) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0))) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8672 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || ((((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5267 SDtfs, 6673 SDslu, 4552 SDs, 0 SdLazy, 4137 SolverSat, 909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4211 GetRequests, 4125 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2224occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.5601190476190477 AbsIntWeakeningRatio, 0.5634920634920635 AbsIntAvgWeakeningVarsNumRemoved, 2.5238095238095237 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 1618 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 2047 HoareAnnotationTreeSize, 33 FomulaSimplifications, 26618 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 33 FomulaSimplificationsInter, 11157 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 8510 NumberOfCodeBlocks, 8510 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4158813 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3490 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 32808/32964 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...