./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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 6dc0763a398b0a639e17ba351b312330c5e02cd6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:30:47,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:30:47,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:30:47,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:30:47,177 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:30:47,178 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:30:47,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:30:47,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:30:47,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:30:47,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:30:47,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:30:47,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:30:47,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:30:47,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:30:47,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:30:47,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:30:47,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:30:47,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:30:47,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:30:47,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:30:47,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:30:47,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:30:47,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:30:47,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:30:47,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:30:47,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:30:47,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:30:47,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:30:47,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:30:47,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:30:47,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:30:47,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:30:47,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:30:47,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:30:47,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:30:47,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:30:47,203 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:30:47,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:30:47,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:30:47,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:30:47,215 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:30:47,216 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:30:47,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:30:47,216 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:30:47,216 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:30:47,216 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:30:47,216 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:30:47,217 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:30:47,217 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:30:47,217 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:30:47,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:30:47,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:30:47,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:30:47,219 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:30:47,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:30:47,219 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:30:47,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:30:47,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:30:47,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:30:47,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:30:47,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:30:47,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:30:47,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:30:47,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:30:47,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:30:47,221 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:30:47,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:30:47,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:30:47,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:30:47,221 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_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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 -> 6dc0763a398b0a639e17ba351b312330c5e02cd6 [2018-11-23 00:30:47,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:30:47,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:30:47,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:30:47,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:30:47,263 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:30:47,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-11-23 00:30:47,304 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/data/2da396771/033dc01b7eeb4e3c8408acaac1f2be2c/FLAGc96c34b7e [2018-11-23 00:30:47,685 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:30:47,685 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/sv-benchmarks/c/ssh-simplified/s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-11-23 00:30:47,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/data/2da396771/033dc01b7eeb4e3c8408acaac1f2be2c/FLAGc96c34b7e [2018-11-23 00:30:47,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/data/2da396771/033dc01b7eeb4e3c8408acaac1f2be2c [2018-11-23 00:30:47,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:30:47,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:30:47,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:30:47,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:30:47,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:30:47,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:47,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47, skipping insertion in model container [2018-11-23 00:30:47,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:47,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:30:47,757 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:30:47,939 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:30:47,942 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:30:47,978 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:30:47,988 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:30:47,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47 WrapperNode [2018-11-23 00:30:47,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:30:47,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:30:47,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:30:47,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:30:47,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:30:48,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:30:48,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:30:48,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:30:48,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... [2018-11-23 00:30:48,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:30:48,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:30:48,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:30:48,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:30:48,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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-11-23 00:30:48,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:30:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:30:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:30:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:30:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:30:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:30:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-23 00:30:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-23 00:30:48,255 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 00:30:48,255 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 00:30:48,648 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:30:48,648 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:30:48,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:48 BoogieIcfgContainer [2018-11-23 00:30:48,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:30:48,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:30:48,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:30:48,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:30:48,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:30:47" (1/3) ... [2018-11-23 00:30:48,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1237947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:48, skipping insertion in model container [2018-11-23 00:30:48,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:47" (2/3) ... [2018-11-23 00:30:48,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1237947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:48, skipping insertion in model container [2018-11-23 00:30:48,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:48" (3/3) ... [2018-11-23 00:30:48,653 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_true-unreach-call_false-termination.cil.c [2018-11-23 00:30:48,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:30:48,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:30:48,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:30:48,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:30:48,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:30:48,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:30:48,702 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:30:48,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:30:48,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:30:48,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:30:48,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:30:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-23 00:30:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 00:30:48,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:48,726 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-11-23 00:30:48,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:48,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2018-11-23 00:30:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:48,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:30:48,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:48,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:48,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:48,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:48,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:48,962 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2018-11-23 00:30:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:49,284 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2018-11-23 00:30:49,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:49,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-23 00:30:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:49,302 INFO L225 Difference]: With dead ends: 337 [2018-11-23 00:30:49,303 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 00:30:49,306 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-11-23 00:30:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 00:30:49,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2018-11-23 00:30:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-23 00:30:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2018-11-23 00:30:49,356 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2018-11-23 00:30:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:49,356 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2018-11-23 00:30:49,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2018-11-23 00:30:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 00:30:49,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:49,358 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-11-23 00:30:49,359 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:49,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2018-11-23 00:30:49,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:30:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:49,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:49,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:49,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:49,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:49,455 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2018-11-23 00:30:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:49,688 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2018-11-23 00:30:49,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:49,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-23 00:30:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:49,690 INFO L225 Difference]: With dead ends: 385 [2018-11-23 00:30:49,691 INFO L226 Difference]: Without dead ends: 221 [2018-11-23 00:30:49,692 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-11-23 00:30:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-23 00:30:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2018-11-23 00:30:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-23 00:30:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2018-11-23 00:30:49,704 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2018-11-23 00:30:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:49,705 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2018-11-23 00:30:49,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2018-11-23 00:30:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 00:30:49,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:49,708 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-11-23 00:30:49,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:49,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2018-11-23 00:30:49,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:49,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:49,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:30:49,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:49,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:49,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:49,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:49,785 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2018-11-23 00:30:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:49,940 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2018-11-23 00:30:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:49,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 00:30:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:49,943 INFO L225 Difference]: With dead ends: 450 [2018-11-23 00:30:49,943 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 00:30:49,944 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-11-23 00:30:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 00:30:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-11-23 00:30:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-23 00:30:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2018-11-23 00:30:49,959 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2018-11-23 00:30:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:49,959 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2018-11-23 00:30:49,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2018-11-23 00:30:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 00:30:49,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:49,962 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-11-23 00:30:49,963 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:49,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2018-11-23 00:30:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:49,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:50,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:50,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:50,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:50,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:50,035 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2018-11-23 00:30:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:50,140 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2018-11-23 00:30:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:50,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-23 00:30:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:50,141 INFO L225 Difference]: With dead ends: 498 [2018-11-23 00:30:50,142 INFO L226 Difference]: Without dead ends: 264 [2018-11-23 00:30:50,142 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-11-23 00:30:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-23 00:30:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-11-23 00:30:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 00:30:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2018-11-23 00:30:50,155 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2018-11-23 00:30:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:50,156 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2018-11-23 00:30:50,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2018-11-23 00:30:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 00:30:50,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:50,158 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-11-23 00:30:50,158 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:50,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2018-11-23 00:30:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:50,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:50,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:30:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:50,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:50,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:50,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:50,214 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2018-11-23 00:30:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:50,383 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2018-11-23 00:30:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:50,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-23 00:30:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:50,386 INFO L225 Difference]: With dead ends: 557 [2018-11-23 00:30:50,386 INFO L226 Difference]: Without dead ends: 308 [2018-11-23 00:30:50,387 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-11-23 00:30:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-23 00:30:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2018-11-23 00:30:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 00:30:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2018-11-23 00:30:50,400 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2018-11-23 00:30:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:50,400 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2018-11-23 00:30:50,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2018-11-23 00:30:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 00:30:50,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:50,402 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-11-23 00:30:50,402 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:50,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2018-11-23 00:30:50,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:50,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:50,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:50,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:50,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:50,447 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2018-11-23 00:30:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:50,580 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2018-11-23 00:30:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:50,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-11-23 00:30:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:50,581 INFO L225 Difference]: With dead ends: 597 [2018-11-23 00:30:50,581 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 00:30:50,582 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-11-23 00:30:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 00:30:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 00:30:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 00:30:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2018-11-23 00:30:50,591 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2018-11-23 00:30:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:50,591 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2018-11-23 00:30:50,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2018-11-23 00:30:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 00:30:50,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:50,592 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-11-23 00:30:50,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:50,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2018-11-23 00:30:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:30:50,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:50,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:50,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:50,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:50,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:50,651 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2018-11-23 00:30:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:50,813 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2018-11-23 00:30:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:50,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-11-23 00:30:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:50,815 INFO L225 Difference]: With dead ends: 599 [2018-11-23 00:30:50,815 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 00:30:50,816 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-11-23 00:30:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 00:30:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2018-11-23 00:30:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-23 00:30:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2018-11-23 00:30:50,825 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2018-11-23 00:30:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:50,825 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2018-11-23 00:30:50,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2018-11-23 00:30:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 00:30:50,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:50,827 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, 1] [2018-11-23 00:30:50,827 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:50,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2018-11-23 00:30:50,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:50,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:50,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:50,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 00:30:50,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:50,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:50,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:50,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:50,882 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2018-11-23 00:30:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:50,986 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2018-11-23 00:30:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:50,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-23 00:30:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:50,988 INFO L225 Difference]: With dead ends: 600 [2018-11-23 00:30:50,988 INFO L226 Difference]: Without dead ends: 311 [2018-11-23 00:30:50,989 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-11-23 00:30:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-23 00:30:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-11-23 00:30:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-23 00:30:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2018-11-23 00:30:50,997 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2018-11-23 00:30:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:50,997 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2018-11-23 00:30:50,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2018-11-23 00:30:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 00:30:50,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:50,999 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-11-23 00:30:50,999 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:50,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2018-11-23 00:30:50,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:51,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:51,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:51,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:51,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:51,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:51,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:51,041 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2018-11-23 00:30:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:51,170 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2018-11-23 00:30:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:51,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-23 00:30:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:51,172 INFO L225 Difference]: With dead ends: 640 [2018-11-23 00:30:51,172 INFO L226 Difference]: Without dead ends: 342 [2018-11-23 00:30:51,173 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-11-23 00:30:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-23 00:30:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-11-23 00:30:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-23 00:30:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2018-11-23 00:30:51,182 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2018-11-23 00:30:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2018-11-23 00:30:51,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2018-11-23 00:30:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 00:30:51,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:51,184 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-11-23 00:30:51,184 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:51,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2018-11-23 00:30:51,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:51,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:51,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:51,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:51,238 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2018-11-23 00:30:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:51,377 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2018-11-23 00:30:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:51,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-23 00:30:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:51,379 INFO L225 Difference]: With dead ends: 669 [2018-11-23 00:30:51,380 INFO L226 Difference]: Without dead ends: 342 [2018-11-23 00:30:51,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-11-23 00:30:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-23 00:30:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-11-23 00:30:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-23 00:30:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2018-11-23 00:30:51,393 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2018-11-23 00:30:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:51,393 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2018-11-23 00:30:51,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2018-11-23 00:30:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 00:30:51,395 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:51,395 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, 1] [2018-11-23 00:30:51,395 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:51,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2018-11-23 00:30:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:51,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:51,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:51,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:51,462 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2018-11-23 00:30:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:51,618 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2018-11-23 00:30:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:51,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-23 00:30:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:51,620 INFO L225 Difference]: With dead ends: 702 [2018-11-23 00:30:51,621 INFO L226 Difference]: Without dead ends: 375 [2018-11-23 00:30:51,621 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-11-23 00:30:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-23 00:30:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2018-11-23 00:30:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-23 00:30:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2018-11-23 00:30:51,642 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2018-11-23 00:30:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:51,642 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2018-11-23 00:30:51,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2018-11-23 00:30:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 00:30:51,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:51,644 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, 1] [2018-11-23 00:30:51,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:51,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2018-11-23 00:30:51,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:30:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:51,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:51,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:51,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:51,698 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2018-11-23 00:30:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:51,825 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2018-11-23 00:30:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:51,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2018-11-23 00:30:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:51,827 INFO L225 Difference]: With dead ends: 729 [2018-11-23 00:30:51,827 INFO L226 Difference]: Without dead ends: 375 [2018-11-23 00:30:51,828 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-11-23 00:30:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-23 00:30:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2018-11-23 00:30:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-23 00:30:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2018-11-23 00:30:51,837 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2018-11-23 00:30:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:51,838 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2018-11-23 00:30:51,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2018-11-23 00:30:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 00:30:51,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:51,839 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-11-23 00:30:51,839 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:51,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2018-11-23 00:30:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:51,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 00:30:51,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:51,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:51,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:51,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:51,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:51,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:51,889 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2018-11-23 00:30:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,012 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2018-11-23 00:30:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:52,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-11-23 00:30:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,014 INFO L225 Difference]: With dead ends: 747 [2018-11-23 00:30:52,014 INFO L226 Difference]: Without dead ends: 393 [2018-11-23 00:30:52,015 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-11-23 00:30:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-23 00:30:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-11-23 00:30:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-23 00:30:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2018-11-23 00:30:52,026 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2018-11-23 00:30:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,027 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2018-11-23 00:30:52,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2018-11-23 00:30:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 00:30:52,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,028 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-11-23 00:30:52,028 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2018-11-23 00:30:52,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 00:30:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:30:52,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:30:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:30:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:52,082 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2018-11-23 00:30:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,196 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2018-11-23 00:30:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:52,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-11-23 00:30:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,198 INFO L225 Difference]: With dead ends: 768 [2018-11-23 00:30:52,198 INFO L226 Difference]: Without dead ends: 393 [2018-11-23 00:30:52,199 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-11-23 00:30:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-23 00:30:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2018-11-23 00:30:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-23 00:30:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2018-11-23 00:30:52,209 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2018-11-23 00:30:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,209 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2018-11-23 00:30:52,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:30:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2018-11-23 00:30:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 00:30:52,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,211 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-11-23 00:30:52,211 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2018-11-23 00:30:52,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 00:30:52,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:52,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:52,252 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2018-11-23 00:30:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,286 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2018-11-23 00:30:52,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:52,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-23 00:30:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,288 INFO L225 Difference]: With dead ends: 763 [2018-11-23 00:30:52,288 INFO L226 Difference]: Without dead ends: 761 [2018-11-23 00:30:52,289 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-11-23 00:30:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-23 00:30:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2018-11-23 00:30:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-23 00:30:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2018-11-23 00:30:52,308 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2018-11-23 00:30:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,308 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2018-11-23 00:30:52,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2018-11-23 00:30:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 00:30:52,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,310 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, 1] [2018-11-23 00:30:52,310 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2018-11-23 00:30:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 00:30:52,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:52,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:52,343 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2018-11-23 00:30:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,390 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2018-11-23 00:30:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:52,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-23 00:30:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,394 INFO L225 Difference]: With dead ends: 1877 [2018-11-23 00:30:52,394 INFO L226 Difference]: Without dead ends: 1129 [2018-11-23 00:30:52,395 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-11-23 00:30:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-11-23 00:30:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2018-11-23 00:30:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-11-23 00:30:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2018-11-23 00:30:52,423 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2018-11-23 00:30:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,424 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2018-11-23 00:30:52,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2018-11-23 00:30:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 00:30:52,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,426 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, 1] [2018-11-23 00:30:52,426 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2018-11-23 00:30:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-23 00:30:52,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:52,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:52,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:52,460 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2018-11-23 00:30:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,524 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2018-11-23 00:30:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-23 00:30:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,529 INFO L225 Difference]: With dead ends: 2596 [2018-11-23 00:30:52,529 INFO L226 Difference]: Without dead ends: 1480 [2018-11-23 00:30:52,531 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-11-23 00:30:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2018-11-23 00:30:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2018-11-23 00:30:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-11-23 00:30:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2018-11-23 00:30:52,581 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2018-11-23 00:30:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,581 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2018-11-23 00:30:52,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2018-11-23 00:30:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 00:30:52,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,585 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 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-11-23 00:30:52,585 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2018-11-23 00:30:52,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 00:30:52,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:52,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:52,646 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2018-11-23 00:30:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:52,803 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2018-11-23 00:30:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:52,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-23 00:30:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:52,807 INFO L225 Difference]: With dead ends: 2987 [2018-11-23 00:30:52,807 INFO L226 Difference]: Without dead ends: 1520 [2018-11-23 00:30:52,809 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-11-23 00:30:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-11-23 00:30:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2018-11-23 00:30:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-11-23 00:30:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2018-11-23 00:30:52,843 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2018-11-23 00:30:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:52,843 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2018-11-23 00:30:52,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2018-11-23 00:30:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 00:30:52,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:52,847 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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-11-23 00:30:52,847 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:52,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2018-11-23 00:30:52,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:52,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 00:30:52,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:52,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:52,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:52,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:52,883 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2018-11-23 00:30:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:53,037 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2018-11-23 00:30:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:53,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-23 00:30:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:53,042 INFO L225 Difference]: With dead ends: 3143 [2018-11-23 00:30:53,042 INFO L226 Difference]: Without dead ends: 1676 [2018-11-23 00:30:53,044 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-11-23 00:30:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-11-23 00:30:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2018-11-23 00:30:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-11-23 00:30:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2018-11-23 00:30:53,086 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2018-11-23 00:30:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:53,087 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2018-11-23 00:30:53,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2018-11-23 00:30:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 00:30:53,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:53,091 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 00:30:53,092 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:53,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2018-11-23 00:30:53,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-23 00:30:53,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:53,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:53,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:53,136 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2018-11-23 00:30:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:53,282 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2018-11-23 00:30:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:53,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-11-23 00:30:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:53,287 INFO L225 Difference]: With dead ends: 3195 [2018-11-23 00:30:53,287 INFO L226 Difference]: Without dead ends: 1648 [2018-11-23 00:30:53,289 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-11-23 00:30:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-11-23 00:30:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2018-11-23 00:30:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-11-23 00:30:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2018-11-23 00:30:53,327 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2018-11-23 00:30:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:53,327 INFO L480 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2018-11-23 00:30:53,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2018-11-23 00:30:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-23 00:30:53,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:53,331 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 00:30:53,331 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:53,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2018-11-23 00:30:53,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 00:30:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:53,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:53,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:53,369 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2018-11-23 00:30:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:53,484 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2018-11-23 00:30:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:53,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-11-23 00:30:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:53,488 INFO L225 Difference]: With dead ends: 3198 [2018-11-23 00:30:53,488 INFO L226 Difference]: Without dead ends: 1651 [2018-11-23 00:30:53,490 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-11-23 00:30:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-11-23 00:30:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2018-11-23 00:30:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-11-23 00:30:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2018-11-23 00:30:53,553 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2018-11-23 00:30:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:53,553 INFO L480 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2018-11-23 00:30:53,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2018-11-23 00:30:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-23 00:30:53,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:53,557 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:53,557 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:53,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2018-11-23 00:30:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:53,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 00:30:53,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:53,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:53,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:53,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:53,596 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2018-11-23 00:30:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:53,729 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2018-11-23 00:30:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:53,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-11-23 00:30:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:53,734 INFO L225 Difference]: With dead ends: 3403 [2018-11-23 00:30:53,734 INFO L226 Difference]: Without dead ends: 1787 [2018-11-23 00:30:53,736 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-11-23 00:30:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-23 00:30:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2018-11-23 00:30:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-23 00:30:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2018-11-23 00:30:53,779 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2018-11-23 00:30:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:53,780 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2018-11-23 00:30:53,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2018-11-23 00:30:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-23 00:30:53,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:53,784 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 00:30:53,784 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:53,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2018-11-23 00:30:53,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:53,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 00:30:53,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:53,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:53,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:53,827 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2018-11-23 00:30:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:53,963 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2018-11-23 00:30:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:53,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-23 00:30:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:53,967 INFO L225 Difference]: With dead ends: 3531 [2018-11-23 00:30:53,967 INFO L226 Difference]: Without dead ends: 1815 [2018-11-23 00:30:53,969 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-11-23 00:30:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-11-23 00:30:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2018-11-23 00:30:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-23 00:30:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2018-11-23 00:30:54,010 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2018-11-23 00:30:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:54,010 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2018-11-23 00:30:54,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2018-11-23 00:30:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-23 00:30:54,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:54,014 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:54,014 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:54,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2018-11-23 00:30:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-11-23 00:30:54,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:54,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:54,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:54,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:54,065 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2018-11-23 00:30:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:54,203 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2018-11-23 00:30:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:54,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-11-23 00:30:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:54,207 INFO L225 Difference]: With dead ends: 3647 [2018-11-23 00:30:54,207 INFO L226 Difference]: Without dead ends: 1831 [2018-11-23 00:30:54,209 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-11-23 00:30:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-11-23 00:30:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2018-11-23 00:30:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-11-23 00:30:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2018-11-23 00:30:54,256 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2018-11-23 00:30:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:54,256 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2018-11-23 00:30:54,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2018-11-23 00:30:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-23 00:30:54,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:54,260 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 00:30:54,261 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:54,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2018-11-23 00:30:54,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-11-23 00:30:54,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:54,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:54,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:54,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:54,345 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2018-11-23 00:30:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:54,475 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2018-11-23 00:30:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:54,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-11-23 00:30:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:54,480 INFO L225 Difference]: With dead ends: 3595 [2018-11-23 00:30:54,480 INFO L226 Difference]: Without dead ends: 1823 [2018-11-23 00:30:54,482 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-11-23 00:30:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-11-23 00:30:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2018-11-23 00:30:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2018-11-23 00:30:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2018-11-23 00:30:54,525 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2018-11-23 00:30:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:54,525 INFO L480 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2018-11-23 00:30:54,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2018-11-23 00:30:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-23 00:30:54,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:54,529 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:30:54,529 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:54,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2018-11-23 00:30:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:54,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-23 00:30:54,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:54,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:54,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-11-23 00:30:54,587 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [493], [498], [503], [509], [514], [516], [519], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:30:54,616 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:54,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:55,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:55,056 INFO L272 AbstractInterpreter]: Visited 91 different actions 228 times. Merged at 75 different actions 122 times. Widened at 1 different actions 1 times. Performed 1081 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1081 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 12 different actions. Largest state had 96 variables. [2018-11-23 00:30:55,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:55,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:55,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:55,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:55,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:55,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:55,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 00:30:55,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 00:30:55,283 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:30:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 00:30:55,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:55,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:55,284 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 3 states. [2018-11-23 00:30:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:55,414 INFO L93 Difference]: Finished difference Result 3585 states and 4844 transitions. [2018-11-23 00:30:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:55,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-11-23 00:30:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:55,419 INFO L225 Difference]: With dead ends: 3585 [2018-11-23 00:30:55,419 INFO L226 Difference]: Without dead ends: 2246 [2018-11-23 00:30:55,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-11-23 00:30:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2018-11-23 00:30:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-11-23 00:30:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3031 transitions. [2018-11-23 00:30:55,480 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3031 transitions. Word has length 251 [2018-11-23 00:30:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:55,481 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 3031 transitions. [2018-11-23 00:30:55,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3031 transitions. [2018-11-23 00:30:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-23 00:30:55,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:55,485 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-23 00:30:55,485 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:55,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2018-11-23 00:30:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:55,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:55,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 00:30:55,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:55,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:55,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-11-23 00:30:55,545 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:30:55,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:55,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:55,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:55,736 INFO L272 AbstractInterpreter]: Visited 77 different actions 202 times. Merged at 64 different actions 115 times. Widened at 2 different actions 2 times. Performed 965 root evaluator evaluations with a maximum evaluation depth of 3. Performed 965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 14 fixpoints after 7 different actions. Largest state had 94 variables. [2018-11-23 00:30:55,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:55,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:55,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:55,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:55,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:55,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:55,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 00:30:55,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 00:30:55,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:30:55,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 00:30:55,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:30:55,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:30:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:30:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:30:55,901 INFO L87 Difference]: Start difference. First operand 2246 states and 3031 transitions. Second operand 4 states. [2018-11-23 00:30:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:56,242 INFO L93 Difference]: Finished difference Result 7160 states and 9675 transitions. [2018-11-23 00:30:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:30:56,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-11-23 00:30:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:56,258 INFO L225 Difference]: With dead ends: 7160 [2018-11-23 00:30:56,258 INFO L226 Difference]: Without dead ends: 4933 [2018-11-23 00:30:56,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 516 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-11-23 00:30:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2018-11-23 00:30:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 2791. [2018-11-23 00:30:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2018-11-23 00:30:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3681 transitions. [2018-11-23 00:30:56,365 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3681 transitions. Word has length 258 [2018-11-23 00:30:56,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:56,365 INFO L480 AbstractCegarLoop]: Abstraction has 2791 states and 3681 transitions. [2018-11-23 00:30:56,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:30:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3681 transitions. [2018-11-23 00:30:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-11-23 00:30:56,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:56,371 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-23 00:30:56,371 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:56,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2018-11-23 00:30:56,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:56,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:56,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-23 00:30:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:56,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:56,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:56,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:56,493 INFO L87 Difference]: Start difference. First operand 2791 states and 3681 transitions. Second operand 3 states. [2018-11-23 00:30:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:56,634 INFO L93 Difference]: Finished difference Result 7820 states and 10371 transitions. [2018-11-23 00:30:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:56,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2018-11-23 00:30:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:56,644 INFO L225 Difference]: With dead ends: 7820 [2018-11-23 00:30:56,644 INFO L226 Difference]: Without dead ends: 5048 [2018-11-23 00:30:56,647 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-11-23 00:30:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2018-11-23 00:30:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5046. [2018-11-23 00:30:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-11-23 00:30:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 6701 transitions. [2018-11-23 00:30:56,784 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 6701 transitions. Word has length 258 [2018-11-23 00:30:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:56,785 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 6701 transitions. [2018-11-23 00:30:56,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 6701 transitions. [2018-11-23 00:30:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-23 00:30:56,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:56,790 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2018-11-23 00:30:56,791 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:56,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2018-11-23 00:30:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:56,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:30:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:30:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:30:56,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:56,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:56,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:30:56,839 INFO L87 Difference]: Start difference. First operand 5046 states and 6701 transitions. Second operand 3 states. [2018-11-23 00:30:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:57,088 INFO L93 Difference]: Finished difference Result 10199 states and 13538 transitions. [2018-11-23 00:30:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:57,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-23 00:30:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:57,097 INFO L225 Difference]: With dead ends: 10199 [2018-11-23 00:30:57,097 INFO L226 Difference]: Without dead ends: 5172 [2018-11-23 00:30:57,102 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-11-23 00:30:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2018-11-23 00:30:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5047. [2018-11-23 00:30:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-11-23 00:30:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6617 transitions. [2018-11-23 00:30:57,236 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6617 transitions. Word has length 261 [2018-11-23 00:30:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:57,236 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6617 transitions. [2018-11-23 00:30:57,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6617 transitions. [2018-11-23 00:30:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-23 00:30:57,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:57,243 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-23 00:30:57,243 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:57,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2018-11-23 00:30:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:57,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:57,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:30:57,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:57,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:57,303 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-11-23 00:30:57,303 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [269], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:30:57,306 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:57,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:57,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:57,523 INFO L272 AbstractInterpreter]: Visited 84 different actions 218 times. Merged at 65 different actions 119 times. Widened at 3 different actions 3 times. Performed 1021 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1021 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 8 different actions. Largest state had 95 variables. [2018-11-23 00:30:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:57,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:57,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:57,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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-11-23 00:30:57,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:57,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:57,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-23 00:30:57,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-23 00:30:57,728 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:30:57,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 00:30:57,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:57,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:57,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:57,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:57,729 INFO L87 Difference]: Start difference. First operand 5047 states and 6617 transitions. Second operand 3 states. [2018-11-23 00:30:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:58,093 INFO L93 Difference]: Finished difference Result 10094 states and 13226 transitions. [2018-11-23 00:30:58,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:58,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-23 00:30:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:58,103 INFO L225 Difference]: With dead ends: 10094 [2018-11-23 00:30:58,103 INFO L226 Difference]: Without dead ends: 5067 [2018-11-23 00:30:58,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:58,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-23 00:30:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5047. [2018-11-23 00:30:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-11-23 00:30:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6607 transitions. [2018-11-23 00:30:58,308 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6607 transitions. Word has length 287 [2018-11-23 00:30:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:58,308 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6607 transitions. [2018-11-23 00:30:58,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:58,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6607 transitions. [2018-11-23 00:30:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-23 00:30:58,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:58,318 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-23 00:30:58,318 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:58,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2018-11-23 00:30:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:58,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:30:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:58,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:58,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-11-23 00:30:58,409 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:30:58,411 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:58,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:58,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:58,708 INFO L272 AbstractInterpreter]: Visited 84 different actions 277 times. Merged at 71 different actions 169 times. Widened at 3 different actions 3 times. Performed 1193 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 22 fixpoints after 12 different actions. Largest state had 95 variables. [2018-11-23 00:30:58,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:58,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:58,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:58,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:30:58,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:58,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:30:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:58,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:30:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-23 00:30:58,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:30:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-23 00:30:59,015 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:30:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 00:30:59,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:30:59,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:30:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:30:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:59,016 INFO L87 Difference]: Start difference. First operand 5047 states and 6607 transitions. Second operand 3 states. [2018-11-23 00:30:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:30:59,387 INFO L93 Difference]: Finished difference Result 10074 states and 13186 transitions. [2018-11-23 00:30:59,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:30:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-11-23 00:30:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:30:59,397 INFO L225 Difference]: With dead ends: 10074 [2018-11-23 00:30:59,397 INFO L226 Difference]: Without dead ends: 5047 [2018-11-23 00:30:59,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:30:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2018-11-23 00:30:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2018-11-23 00:30:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2018-11-23 00:30:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6597 transitions. [2018-11-23 00:30:59,585 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6597 transitions. Word has length 288 [2018-11-23 00:30:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:30:59,588 INFO L480 AbstractCegarLoop]: Abstraction has 5047 states and 6597 transitions. [2018-11-23 00:30:59,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:30:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6597 transitions. [2018-11-23 00:30:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-11-23 00:30:59,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:30:59,598 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-23 00:30:59,598 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:30:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2018-11-23 00:30:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:30:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:59,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:30:59,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:30:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:30:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:30:59,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:59,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:30:59,689 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2018-11-23 00:30:59,690 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [55], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:30:59,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:30:59,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:30:59,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:30:59,926 INFO L272 AbstractInterpreter]: Visited 83 different actions 221 times. Merged at 69 different actions 123 times. Widened at 3 different actions 3 times. Performed 1039 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1039 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 8 different actions. Largest state had 95 variables. [2018-11-23 00:30:59,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:30:59,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:30:59,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:30:59,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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-11-23 00:30:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:30:59,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:31:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:00,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:31:00,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:31:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-23 00:31:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:31:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 00:31:00,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:31:00,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:31:00,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:31:00,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:31:00,143 INFO L87 Difference]: Start difference. First operand 5047 states and 6597 transitions. Second operand 4 states. [2018-11-23 00:31:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:00,829 INFO L93 Difference]: Finished difference Result 11856 states and 15438 transitions. [2018-11-23 00:31:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:31:00,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-11-23 00:31:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:00,842 INFO L225 Difference]: With dead ends: 11856 [2018-11-23 00:31:00,842 INFO L226 Difference]: Without dead ends: 6763 [2018-11-23 00:31:00,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 576 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-11-23 00:31:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2018-11-23 00:31:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 4456. [2018-11-23 00:31:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2018-11-23 00:31:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5756 transitions. [2018-11-23 00:31:00,998 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5756 transitions. Word has length 288 [2018-11-23 00:31:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:00,998 INFO L480 AbstractCegarLoop]: Abstraction has 4456 states and 5756 transitions. [2018-11-23 00:31:00,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:31:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5756 transitions. [2018-11-23 00:31:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-23 00:31:01,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:01,005 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:01,005 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:01,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2018-11-23 00:31:01,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:01,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:01,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-11-23 00:31:01,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:01,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:31:01,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:31:01,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:31:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:31:01,070 INFO L87 Difference]: Start difference. First operand 4456 states and 5756 transitions. Second operand 3 states. [2018-11-23 00:31:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:01,217 INFO L93 Difference]: Finished difference Result 7492 states and 9566 transitions. [2018-11-23 00:31:01,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:01,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2018-11-23 00:31:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:01,220 INFO L225 Difference]: With dead ends: 7492 [2018-11-23 00:31:01,220 INFO L226 Difference]: Without dead ends: 2273 [2018-11-23 00:31:01,225 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-11-23 00:31:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2018-11-23 00:31:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2018-11-23 00:31:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2018-11-23 00:31:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2893 transitions. [2018-11-23 00:31:01,281 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2893 transitions. Word has length 326 [2018-11-23 00:31:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:01,281 INFO L480 AbstractCegarLoop]: Abstraction has 2273 states and 2893 transitions. [2018-11-23 00:31:01,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:31:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2893 transitions. [2018-11-23 00:31:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-23 00:31:01,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:01,286 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 00:31:01,287 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:01,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2018-11-23 00:31:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-11-23 00:31:01,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:31:01,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:31:01,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:31:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:31:01,354 INFO L87 Difference]: Start difference. First operand 2273 states and 2893 transitions. Second operand 3 states. [2018-11-23 00:31:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:01,488 INFO L93 Difference]: Finished difference Result 4511 states and 5729 transitions. [2018-11-23 00:31:01,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:01,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-23 00:31:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:01,492 INFO L225 Difference]: With dead ends: 4511 [2018-11-23 00:31:01,492 INFO L226 Difference]: Without dead ends: 2283 [2018-11-23 00:31:01,495 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-11-23 00:31:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2018-11-23 00:31:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2273. [2018-11-23 00:31:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2018-11-23 00:31:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2868 transitions. [2018-11-23 00:31:01,551 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2868 transitions. Word has length 365 [2018-11-23 00:31:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:01,551 INFO L480 AbstractCegarLoop]: Abstraction has 2273 states and 2868 transitions. [2018-11-23 00:31:01,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:31:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2868 transitions. [2018-11-23 00:31:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-23 00:31:01,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:01,557 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 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, 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-11-23 00:31:01,557 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:01,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2018-11-23 00:31:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:01,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:01,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:01,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-23 00:31:01,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:01,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:31:01,643 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-11-23 00:31:01,643 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:31:01,645 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:31:01,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:31:01,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:31:01,835 INFO L272 AbstractInterpreter]: Visited 101 different actions 260 times. Merged at 86 different actions 141 times. Widened at 3 different actions 3 times. Performed 1255 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1255 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 14 different actions. Largest state had 97 variables. [2018-11-23 00:31:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:01,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:31:01,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:01,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:31:01,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:01,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:31:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:01,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-11-23 00:31:02,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:31:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2018-11-23 00:31:02,152 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:31:02,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 00:31:02,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:31:02,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:31:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:31:02,154 INFO L87 Difference]: Start difference. First operand 2273 states and 2868 transitions. Second operand 3 states. [2018-11-23 00:31:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:02,221 INFO L93 Difference]: Finished difference Result 2892 states and 3673 transitions. [2018-11-23 00:31:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:02,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2018-11-23 00:31:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:02,226 INFO L225 Difference]: With dead ends: 2892 [2018-11-23 00:31:02,226 INFO L226 Difference]: Without dead ends: 2800 [2018-11-23 00:31:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:31:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2018-11-23 00:31:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2183. [2018-11-23 00:31:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2018-11-23 00:31:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2767 transitions. [2018-11-23 00:31:02,281 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2767 transitions. Word has length 398 [2018-11-23 00:31:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:02,282 INFO L480 AbstractCegarLoop]: Abstraction has 2183 states and 2767 transitions. [2018-11-23 00:31:02,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:31:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2767 transitions. [2018-11-23 00:31:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-11-23 00:31:02,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:02,286 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-23 00:31:02,286 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:02,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2018-11-23 00:31:02,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:02,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:02,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-11-23 00:31:02,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:02,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:31:02,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 539 with the following transitions: [2018-11-23 00:31:02,409 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:31:02,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:31:02,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:31:02,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:31:02,613 INFO L272 AbstractInterpreter]: Visited 100 different actions 328 times. Merged at 84 different actions 203 times. Widened at 2 different actions 2 times. Performed 1434 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 15 different actions. Largest state had 97 variables. [2018-11-23 00:31:02,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:02,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:31:02,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:02,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/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-11-23 00:31:02,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:02,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:31:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:02,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-11-23 00:31:02,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:31:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2018-11-23 00:31:02,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:31:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 00:31:02,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:31:02,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:31:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:31:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:31:02,935 INFO L87 Difference]: Start difference. First operand 2183 states and 2767 transitions. Second operand 4 states. [2018-11-23 00:31:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:03,289 INFO L93 Difference]: Finished difference Result 5269 states and 6675 transitions. [2018-11-23 00:31:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:31:03,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2018-11-23 00:31:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:03,294 INFO L225 Difference]: With dead ends: 5269 [2018-11-23 00:31:03,294 INFO L226 Difference]: Without dead ends: 3089 [2018-11-23 00:31:03,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1076 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-11-23 00:31:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2018-11-23 00:31:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2243. [2018-11-23 00:31:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-11-23 00:31:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2847 transitions. [2018-11-23 00:31:03,386 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2847 transitions. Word has length 538 [2018-11-23 00:31:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:03,386 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 2847 transitions. [2018-11-23 00:31:03,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:31:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2847 transitions. [2018-11-23 00:31:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-11-23 00:31:03,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:03,391 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-23 00:31:03,392 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:03,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2018-11-23 00:31:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:03,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2018-11-23 00:31:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:31:03,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:31:03,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:31:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:31:03,631 INFO L87 Difference]: Start difference. First operand 2243 states and 2847 transitions. Second operand 3 states. [2018-11-23 00:31:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:03,795 INFO L93 Difference]: Finished difference Result 4621 states and 5867 transitions. [2018-11-23 00:31:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2018-11-23 00:31:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:03,800 INFO L225 Difference]: With dead ends: 4621 [2018-11-23 00:31:03,800 INFO L226 Difference]: Without dead ends: 2423 [2018-11-23 00:31:03,803 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-11-23 00:31:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2018-11-23 00:31:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2413. [2018-11-23 00:31:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2018-11-23 00:31:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3042 transitions. [2018-11-23 00:31:03,936 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3042 transitions. Word has length 600 [2018-11-23 00:31:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:03,937 INFO L480 AbstractCegarLoop]: Abstraction has 2413 states and 3042 transitions. [2018-11-23 00:31:03,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:31:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3042 transitions. [2018-11-23 00:31:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-11-23 00:31:03,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:03,943 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-23 00:31:03,943 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:03,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2018-11-23 00:31:03,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:03,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:03,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2018-11-23 00:31:04,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:04,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:31:04,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:31:04,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:31:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:31:04,178 INFO L87 Difference]: Start difference. First operand 2413 states and 3042 transitions. Second operand 3 states. [2018-11-23 00:31:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:04,308 INFO L93 Difference]: Finished difference Result 4778 states and 6009 transitions. [2018-11-23 00:31:04,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:04,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2018-11-23 00:31:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:04,312 INFO L225 Difference]: With dead ends: 4778 [2018-11-23 00:31:04,312 INFO L226 Difference]: Without dead ends: 2410 [2018-11-23 00:31:04,314 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-11-23 00:31:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2018-11-23 00:31:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2018-11-23 00:31:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2018-11-23 00:31:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2987 transitions. [2018-11-23 00:31:04,370 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2987 transitions. Word has length 662 [2018-11-23 00:31:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 2408 states and 2987 transitions. [2018-11-23 00:31:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:31:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2987 transitions. [2018-11-23 00:31:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2018-11-23 00:31:04,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:31:04,375 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-23 00:31:04,375 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:31:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2018-11-23 00:31:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:31:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:04,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:31:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-11-23 00:31:04,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:04,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 00:31:04,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 729 with the following transitions: [2018-11-23 00:31:04,558 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [447], [452], [457], [462], [465], [470], [472], [477], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2018-11-23 00:31:04,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 00:31:04,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 00:31:04,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 00:31:04,812 INFO L272 AbstractInterpreter]: Visited 111 different actions 361 times. Merged at 92 different actions 219 times. Widened at 2 different actions 2 times. Performed 1642 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1642 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 18 different actions. Largest state had 101 variables. [2018-11-23 00:31:04,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:04,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 00:31:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:04,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:31:04,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:04,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 00:31:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:04,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-11-23 00:31:05,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:31:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-11-23 00:31:05,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 00:31:05,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 00:31:05,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 00:31:05,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:31:05,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:31:05,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:31:05,402 INFO L87 Difference]: Start difference. First operand 2408 states and 2987 transitions. Second operand 4 states. [2018-11-23 00:31:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:05,603 INFO L93 Difference]: Finished difference Result 4118 states and 5143 transitions. [2018-11-23 00:31:05,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:31:05,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2018-11-23 00:31:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:31:05,604 INFO L225 Difference]: With dead ends: 4118 [2018-11-23 00:31:05,604 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:31:05,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1456 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-11-23 00:31:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:31:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:31:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:31:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:31:05,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2018-11-23 00:31:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:31:05,611 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:31:05,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:31:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:31:05,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:31:05,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:31:05,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:05,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,692 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 466 DAG size of output: 273 [2018-11-23 00:31:06,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:06,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,347 WARN L180 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 274 [2018-11-23 00:31:07,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:07,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 00:31:08,137 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-11-23 00:31:08,474 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 60 [2018-11-23 00:31:08,895 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2018-11-23 00:31:09,289 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-11-23 00:31:09,602 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-11-23 00:31:09,797 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2018-11-23 00:31:10,189 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-11-23 00:31:10,636 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-11-23 00:31:13,682 WARN L180 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 220 DAG size of output: 138 [2018-11-23 00:31:14,073 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2018-11-23 00:31:16,673 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 221 DAG size of output: 136 [2018-11-23 00:31:17,079 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2018-11-23 00:31:17,521 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-11-23 00:31:17,919 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 54 [2018-11-23 00:31:18,166 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2018-11-23 00:31:18,558 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2018-11-23 00:31:18,844 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2018-11-23 00:31:19,207 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 65 [2018-11-23 00:31:19,623 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 58 [2018-11-23 00:31:20,584 WARN L180 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 78 [2018-11-23 00:31:20,827 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-23 00:31:20,832 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 00:31:20,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:31:20,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:31:20,832 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 00:31:20,832 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:31:20,832 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 612 623) the Hoare annotation is: true [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 612 623) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L444 ceAbstractionStarter]: At program point L619(line 619) the Hoare annotation is: (and (<= 8464 main_~s~0) (<= main_~s~0 8464)) [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L619-1(line 619) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 612 623) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 546) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 557) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 568) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 579) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 436) no Hoare annotation was computed. [2018-11-23 00:31:20,833 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 372) no Hoare annotation was computed. [2018-11-23 00:31:20,834 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 547) the Hoare annotation is: (let ((.cse4 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse1 (not (= 8656 ssl3_accept_~s__state~0))) (.cse2 (not (= 12292 ssl3_accept_~s__state~0))) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8480) (and .cse4 .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (and .cse4 .cse0 .cse1 .cse2 (not (= ssl3_accept_~s__hit~0 0)) .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 (= ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,834 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 579) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-11-23 00:31:20,834 INFO L451 ceAbstractionStarter]: At program point L599(lines 98 600) the Hoare annotation is: true [2018-11-23 00:31:20,834 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 535) no Hoare annotation was computed. [2018-11-23 00:31:20,834 INFO L444 ceAbstractionStarter]: At program point L401(lines 392 410) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (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 .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-11-23 00:31:20,834 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 545) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 556) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 567) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 578) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 371) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L448 ceAbstractionStarter]: For program point L337-1(lines 337 371) no Hoare annotation was computed. [2018-11-23 00:31:20,835 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (not (= 8672 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-11-23 00:31:20,835 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 557) 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 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 (= ssl3_accept_~s__hit~0 0) .cse4 .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,835 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 568) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse7 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse8 (not (= 8481 ssl3_accept_~s__state~0))) (.cse9 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ssl3_accept_~blastFlag~0 0) .cse9) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse9 (and .cse0 .cse1 .cse2 (= ssl3_accept_~blastFlag~0 1) .cse3 .cse4 .cse5 .cse6 .cse8)) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 (= ssl3_accept_~s__hit~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 472) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 368) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 545) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (not (= 8672 ssl3_accept_~s__state~0)) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 555) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 566) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 577) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 606) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 508) no Hoare annotation was computed. [2018-11-23 00:31:20,836 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 542) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L451 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 11 611) the Hoare annotation is: true [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 308 315) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 554) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 565) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 576) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 366) no Hoare annotation was computed. [2018-11-23 00:31:20,837 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-11-23 00:31:20,838 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 578) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse10 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 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)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse8 .cse9) .cse10) (= |ssl3_accept_#in~initial_state| 8656) (and .cse1 .cse2 (not (= 8673 ssl3_accept_~s__state~0)) .cse3 (not (= 8672 ssl3_accept_~s__state~0)) .cse4 .cse5 (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse6 .cse7 .cse8 .cse9 (= ssl3_accept_~blastFlag~0 0) (not (= 12292 ssl3_accept_~s__state~0))) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496))) [2018-11-23 00:31:20,838 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 555) 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 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (<= ssl3_accept_~s__state~0 8640)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 (= ssl3_accept_~s__hit~0 0) .cse4 .cse5 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496))) [2018-11-23 00:31:20,838 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 566) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0))) (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,839 INFO L444 ceAbstractionStarter]: At program point L543(lines 99 598) the Hoare annotation is: (let ((.cse31 (= |ssl3_accept_#in~initial_state| 8496)) (.cse4 (= |ssl3_accept_#in~initial_state| 8497)) (.cse27 (= |ssl3_accept_#in~initial_state| 8561)) (.cse26 (= |ssl3_accept_#in~initial_state| 8544)) (.cse21 (= |ssl3_accept_#in~initial_state| 12292))) (let ((.cse18 (= ssl3_accept_~s__hit~0 0)) (.cse35 (= |ssl3_accept_#in~initial_state| 8673)) (.cse33 (= |ssl3_accept_#in~initial_state| 8480)) (.cse37 (= |ssl3_accept_#in~initial_state| 8560)) (.cse34 (= |ssl3_accept_#in~initial_state| 8448)) (.cse1 (= ssl3_accept_~blastFlag~0 1)) (.cse36 (= |ssl3_accept_#in~initial_state| 8672)) (.cse39 (not (= 8560 ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ssl3_accept_~s__state~0))) (.cse40 (not .cse21)) (.cse41 (<= 8512 ssl3_accept_~s__state~0)) (.cse14 (<= ssl3_accept_~s__state~0 8640)) (.cse42 (not .cse26)) (.cse43 (not .cse27)) (.cse8 (not (= 8561 ssl3_accept_~s__state~0))) (.cse44 (not .cse4)) (.cse28 (= ssl3_accept_~blastFlag~0 0)) (.cse45 (not .cse31))) (let ((.cse6 (not (= 8497 ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse25 (= ssl3_accept_~s__state~0 8592)) (.cse30 (and .cse39 .cse5 .cse40 .cse41 .cse14 .cse42 .cse43 .cse8 .cse44 .cse28 .cse45)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse15 (<= 8640 ssl3_accept_~s__state~0)) (.cse12 (<= ssl3_accept_~s__state~0 8576)) (.cse17 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse38 (<= ssl3_accept_~s__state~0 3)) (.cse23 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse13 (<= ssl3_accept_~blastFlag~0 2)) (.cse24 (and (not .cse35) (not .cse33) .cse39 (not .cse37) .cse5 (not .cse34) (not (= 8544 ssl3_accept_~s__state~0)) .cse40 .cse41 .cse14 .cse42 .cse1 .cse43 .cse8 .cse44 .cse45 (not .cse36))) (.cse32 (= ssl3_accept_~s__state~0 8608)) (.cse10 (<= 8448 ssl3_accept_~s__state~0)) (.cse29 (<= ssl3_accept_~s__state~0 8448)) (.cse19 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse20 (not (= 8656 ssl3_accept_~s__state~0))) (.cse16 (not .cse18)) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse14 .cse15 .cse17) (and (= ssl3_accept_~s__state~0 8544) .cse13 .cse18) (and .cse19 .cse0 .cse20 .cse17 .cse2 .cse3) .cse21 (and .cse13 .cse22 .cse16 .cse3) (and .cse19 .cse22 .cse23 .cse16 .cse3) (and .cse24 .cse25) .cse26 (and (= ssl3_accept_~s__state~0 8528) .cse13 .cse18) .cse27 (and .cse13 .cse18 .cse17 .cse25) (and .cse12 (and .cse5 (not (= 8496 ssl3_accept_~s__state~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28)) (and .cse14 .cse15 .cse28) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse10 .cse23 .cse16 .cse29) (and .cse25 .cse30) .cse31 (and .cse32 .cse30) (and .cse14 .cse1 .cse15) (and .cse17 .cse12 .cse1) .cse33 .cse34 .cse35 (and .cse13 .cse17 .cse12 .cse18) (and (and .cse13 .cse22 .cse3) .cse17) (and .cse14 .cse15 .cse23 .cse16) .cse36 .cse37 (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8560)) (and .cse13 .cse38) (and .cse17 .cse28 .cse12) (and .cse13 .cse18 .cse17 .cse32) (and .cse0 .cse28 .cse2 .cse3) (and .cse38 .cse23) (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8512)) (and .cse24 .cse32) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse18 .cse19 .cse10 .cse29) (= |ssl3_accept_#in~initial_state| 8656) (and .cse19 .cse0 .cse20 .cse16 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657))))) [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 446) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 553) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 564) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 575) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L346-2(lines 346 350) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2018-11-23 00:31:20,839 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 412) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 515) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 456) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 552) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 563) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 574) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 596) no Hoare annotation was computed. [2018-11-23 00:31:20,840 INFO L444 ceAbstractionStarter]: At program point L514(lines 72 610) the Hoare annotation is: (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)) [2018-11-23 00:31:20,841 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 553) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__state~0 8608))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__hit~0 0) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0) (= |ssl3_accept_#in~initial_state| 8673) (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (<= 8512 ssl3_accept_~s__state~0) (<= ssl3_accept_~s__state~0 8640) (not (= 8561 ssl3_accept_~s__state~0)) (= ssl3_accept_~blastFlag~0 0)) (and (= ssl3_accept_~blastFlag~0 1) .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,841 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 564) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (and .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 595) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 587) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 518) no Hoare annotation was computed. [2018-11-23 00:31:20,841 INFO L448 ceAbstractionStarter]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 544) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 551) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 544) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 562) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 573) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 453) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 574) 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse8 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse9 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5 .cse6 .cse7 .cse8 .cse9) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ssl3_accept_~blastFlag~0 0) .cse9) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-23 00:31:20,842 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 11 611) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 362) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 550) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 561) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 572) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 610) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L448 ceAbstractionStarter]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2018-11-23 00:31:20,843 INFO L444 ceAbstractionStarter]: At program point L355(lines 331 373) the Hoare annotation is: (let ((.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8544 ssl3_accept_~s__state~0))) (.cse4 (<= 8512 ssl3_accept_~s__state~0)) (.cse5 (not (= 8561 ssl3_accept_~s__state~0))) (.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ssl3_accept_~blastFlag~0 1) .cse5)) (and .cse1 .cse2 (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse4 (= ssl3_accept_~s__hit~0 0) .cse5 .cse0) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 0)) .cse0) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,843 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 551) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (<= ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 12292) (and .cse1 .cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse3) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and (not (= 8656 ssl3_accept_~s__state~0)) .cse2 (<= ssl3_accept_~s__state~0 8656) (= ssl3_accept_~blastFlag~0 0)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse1 (= ssl3_accept_~blastFlag~0 1) .cse2))) [2018-11-23 00:31:20,844 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 562) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (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 .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-11-23 00:31:20,844 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 572) 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 (<= ssl3_accept_~s__state~0 8640)) (.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 (<= 8448 ssl3_accept_~s__state~0)) (.cse10 (not (= 8481 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse10) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,844 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-23 00:31:20,844 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 424) no Hoare annotation was computed. [2018-11-23 00:31:20,844 INFO L444 ceAbstractionStarter]: At program point L389(lines 380 412) the Hoare annotation is: (let ((.cse5 (= |ssl3_accept_#in~initial_state| 8673)) (.cse0 (= |ssl3_accept_#in~initial_state| 8480)) (.cse1 (= |ssl3_accept_#in~initial_state| 8448))) (let ((.cse3 (<= 8512 ssl3_accept_~s__state~0)) (.cse4 (and (not .cse5) (not .cse0) (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 .cse1) (not (= 8481 ssl3_accept_~s__state~0)))) (.cse2 (<= ssl3_accept_~s__state~0 8576))) (or .cse0 .cse1 (and .cse2 (and .cse3 (= ssl3_accept_~blastFlag~0 1) .cse4)) (and .cse2 (and (<= ssl3_accept_~blastFlag~0 2) (and .cse3 .cse4)) (= ssl3_accept_~s__hit~0 0)) (= |ssl3_accept_#in~initial_state| 8497) .cse5 (and (and (= ssl3_accept_~blastFlag~0 0) .cse3 .cse4) .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560)))) [2018-11-23 00:31:20,844 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-23 00:31:20,844 INFO L448 ceAbstractionStarter]: For program point L290-2(lines 208 542) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 11 611) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 549) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 560) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 571) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L325(lines 325 329) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L325-2(lines 208 542) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 542) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 410) no Hoare annotation was computed. [2018-11-23 00:31:20,845 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 495) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 399) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 548) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 559) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 570) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 549) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse4 (not (= ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8672 ssl3_accept_~s__state~0))) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (and .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8673) (and .cse1 (<= ssl3_accept_~blastFlag~0 3) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4 .cse2 .cse3) (and .cse1 (= ssl3_accept_~blastFlag~0 1) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,846 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 560) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (<= 8512 ssl3_accept_~s__state~0))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and .cse0 (and .cse1 .cse2 (= ssl3_accept_~blastFlag~0 0) .cse3)) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560) (and .cse0 (and .cse1 .cse2 .cse3 (= ssl3_accept_~blastFlag~0 1))) (and .cse0 (= ssl3_accept_~s__hit~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3)))) [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-11-23 00:31:20,846 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L297-2(lines 297 301) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 547) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 558) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 569) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 598) the Hoare annotation is: (let ((.cse18 (= ssl3_accept_~s__hit~0 0)) (.cse33 (= |ssl3_accept_#in~initial_state| 8673)) (.cse31 (= |ssl3_accept_#in~initial_state| 8480)) (.cse35 (= |ssl3_accept_#in~initial_state| 8560)) (.cse5 (not (= 8545 ssl3_accept_~s__state~0))) (.cse32 (= |ssl3_accept_#in~initial_state| 8448)) (.cse21 (= |ssl3_accept_#in~initial_state| 12292)) (.cse14 (<= ssl3_accept_~s__state~0 8640)) (.cse26 (= |ssl3_accept_#in~initial_state| 8544)) (.cse1 (= ssl3_accept_~blastFlag~0 1)) (.cse28 (= |ssl3_accept_#in~initial_state| 8561)) (.cse8 (not (= 8561 ssl3_accept_~s__state~0))) (.cse4 (= |ssl3_accept_#in~initial_state| 8497)) (.cse30 (= |ssl3_accept_#in~initial_state| 8496)) (.cse34 (= |ssl3_accept_#in~initial_state| 8672))) (let ((.cse6 (not (= 8497 ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse25 (= ssl3_accept_~s__state~0 8592)) (.cse12 (<= ssl3_accept_~s__state~0 8576)) (.cse22 (<= ssl3_accept_~s__state~0 8656)) (.cse15 (<= 8640 ssl3_accept_~s__state~0)) (.cse27 (= ssl3_accept_~blastFlag~0 0)) (.cse17 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse36 (<= ssl3_accept_~s__state~0 3)) (.cse23 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse13 (<= ssl3_accept_~blastFlag~0 2)) (.cse24 (and (not .cse33) (not .cse31) (not (= 8560 ssl3_accept_~s__state~0)) (not .cse35) .cse5 (not .cse32) (not (= 8544 ssl3_accept_~s__state~0)) (not .cse21) (<= 8512 ssl3_accept_~s__state~0) .cse14 (not .cse26) .cse1 (not .cse28) .cse8 (not .cse4) (not .cse30) (not .cse34))) (.cse37 (= ssl3_accept_~s__state~0 8608)) (.cse10 (<= 8448 ssl3_accept_~s__state~0)) (.cse29 (<= ssl3_accept_~s__state~0 8448)) (.cse19 (<= ssl3_accept_~blastFlag~0 3)) (.cse0 (not (= 8657 ssl3_accept_~s__state~0))) (.cse20 (not (= 8656 ssl3_accept_~s__state~0))) (.cse16 (not .cse18)) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse14 .cse15 .cse17) (and (= ssl3_accept_~s__state~0 8544) .cse13 .cse18) (and .cse19 .cse0 .cse20 .cse17 .cse2 .cse3) .cse21 (and .cse13 .cse22 .cse16 .cse3) (and .cse19 .cse22 .cse23 .cse16 .cse3) (and .cse24 .cse25) .cse26 (and (= ssl3_accept_~s__state~0 8528) .cse13 .cse18) (and .cse5 (not (= 8673 ssl3_accept_~s__state~0)) (not (= 8496 ssl3_accept_~s__state~0)) .cse6 .cse0 .cse7 .cse8 .cse9 .cse11 .cse27 (not (= 12292 ssl3_accept_~s__state~0))) .cse28 (and .cse13 .cse18 .cse17 .cse25) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse10 .cse23 .cse16 .cse29) .cse30 (and .cse14 .cse1 .cse15) (and .cse17 .cse12 .cse1) .cse31 .cse32 .cse33 (and .cse13 .cse17 .cse12 .cse18) (and (and .cse13 .cse22 .cse3) .cse17) (and .cse14 .cse15 .cse23 .cse16) .cse34 .cse35 (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8560)) (and .cse13 .cse36) (and .cse17 .cse27 .cse14) (and .cse13 .cse18 .cse17 .cse37) (and .cse36 .cse23) (and .cse13 .cse18 (= ssl3_accept_~s__state~0 8512)) (and .cse24 .cse37) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse18 .cse19 .cse10 .cse29) (= |ssl3_accept_#in~initial_state| 8656) (and .cse19 .cse0 .cse20 .cse16 .cse2 .cse3) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657)))) [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 430 438) no Hoare annotation was computed. [2018-11-23 00:31:20,847 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-11-23 00:31:20,848 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 558) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (= ssl3_accept_~s__hit~0 0)) (.cse0 (<= 8448 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__state~0 8448))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (and (= ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (and (<= ssl3_accept_~blastFlag~0 2) .cse3 .cse0 .cse1 .cse2) (and (<= 8640 ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8640) (not .cse3) .cse2) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 0) .cse2) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse3 (<= ssl3_accept_~blastFlag~0 3) .cse0 .cse2) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,848 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 571) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576)) (.cse1 (not (= 8560 ssl3_accept_~s__state~0))) (.cse2 (not (= 8545 ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 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 (<= 8448 ssl3_accept_~s__state~0)) (.cse10 (not (= 8481 ssl3_accept_~s__state~0)))) (or (= |ssl3_accept_#in~initial_state| 8480) (= |ssl3_accept_#in~initial_state| 8448) (= |ssl3_accept_#in~initial_state| 8497) (= |ssl3_accept_#in~initial_state| 8673) (= |ssl3_accept_#in~initial_state| 8656) (= |ssl3_accept_#in~initial_state| 12292) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~blastFlag~0 1) .cse6 .cse7 .cse8 .cse9 .cse10)) (= |ssl3_accept_#in~initial_state| 8544) (= |ssl3_accept_#in~initial_state| 8672) (= |ssl3_accept_#in~initial_state| 8545) (= |ssl3_accept_#in~initial_state| 8481) (and .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 (= ssl3_accept_~s__hit~0 0) .cse6 .cse7 .cse8 .cse9 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse0) (= |ssl3_accept_#in~initial_state| 8657) (= |ssl3_accept_#in~initial_state| 8496) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ssl3_accept_~blastFlag~0 0))) (= |ssl3_accept_#in~initial_state| 8561) (= |ssl3_accept_#in~initial_state| 8560))) [2018-11-23 00:31:20,848 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-23 00:31:20,848 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 536) no Hoare annotation was computed. [2018-11-23 00:31:20,848 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-23 00:31:20,848 INFO L448 ceAbstractionStarter]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2018-11-23 00:31:20,848 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 208 542) no Hoare annotation was computed. [2018-11-23 00:31:20,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:31:20 BoogieIcfgContainer [2018-11-23 00:31:20,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:31:20,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:31:20,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:31:20,907 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:31:20,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:48" (3/4) ... [2018-11-23 00:31:20,919 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:31:20,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:31:20,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:31:20,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_accept [2018-11-23 00:31:20,938 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 00:31:20,939 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 00:31:20,939 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:31:20,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || ((((((((((!(8545 == s__state) && !(8673 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8640)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 [2018-11-23 00:31:20,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((s__state <= 8576 && s__hit == 0) && blastFlag <= 2 && (((((((!(8560 == s__state) && !(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__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8576 && ((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8656) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == 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)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 [2018-11-23 00:31:20,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,974 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(8481 == s__state))) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,974 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (s__state <= 8576 && (((((((!(8545 == s__state) && !(8496 == s__state)) && !(8497 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (s__state == 8592 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || \old(initial_state) == 8496) || (s__state == 8608 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (((!(8657 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 [2018-11-23 00:31:20,974 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,974 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (s__state <= 8576 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,974 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && blastFlag == 0) && 8512 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__hit == 0) && ((blastFlag <= 2 && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,975 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,976 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((blastFlag == 1 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || ((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (((8448 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,976 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,976 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 [2018-11-23 00:31:20,976 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || (blastFlag == 1 && s__state == 8608)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((!(8656 == s__state) && 8640 <= s__state) && s__state <= 8656) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state) [2018-11-23 00:31:20,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((blastFlag <= 2 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8673) || (((((!(8672 == s__state) && blastFlag <= 3) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || (((!(8672 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state)) || ((((blastFlag <= 2 && !(8672 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((!(8672 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(8657 == s__state) && !(8656 == s__state)) && blastFlag == 0) && !(12292 == s__state)) && 8656 <= s__state) || \old(initial_state) == 8480) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((((!(8657 == s__state) && blastFlag == 1) && !(8656 == s__state)) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,977 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:20,978 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 [2018-11-23 00:31:21,034 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc8e4eaf-e975-4def-9f96-e54dda41ba17/bin-2019/utaipan/witness.graphml [2018-11-23 00:31:21,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:31:21,035 INFO L168 Benchmark]: Toolchain (without parser) took 33325.29 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 959.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 834.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:21,035 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:21,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:21,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:21,036 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:21,036 INFO L168 Benchmark]: RCFGBuilder took 555.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:21,036 INFO L168 Benchmark]: TraceAbstraction took 32257.45 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-23 00:31:21,036 INFO L168 Benchmark]: Witness Printer took 127.65 ms. Allocated memory is still 3.0 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:21,038 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.99 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 940.3 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 555.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32257.45 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 127.65 ms. Allocated memory is still 3.0 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || (blastFlag == 1 && s__state == 8608)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((blastFlag == 1 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || ((((blastFlag <= 2 && s__hit == 0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (((8448 <= s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8448)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(8481 == s__state))) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__state <= 8640) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((!(8656 == s__state) && 8640 <= s__state) && s__state <= 8656) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || (s__state <= 8576 && (((((((!(8545 == s__state) && !(8496 == s__state)) && !(8497 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && blastFlag == 0)) || ((s__state <= 8640 && 8640 <= s__state) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || (s__state == 8592 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || \old(initial_state) == 8496) || (s__state == 8608 && (((((((((!(8560 == s__state) && !(8545 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && blastFlag == 0) && !(\old(initial_state) == 8496))) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (((!(8657 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || (s__state <= 8576 && (((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state))) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((!(8657 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state) || \old(initial_state) == 8497) || ((((((((!(8545 == s__state) && !(8497 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && s__state <= 8576)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8544 && blastFlag <= 2) && s__hit == 0)) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 12292) || (((blastFlag <= 2 && s__state <= 8656) && !(s__hit == 0)) && 8656 <= s__state)) || ((((blastFlag <= 3 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && 8656 <= s__state)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8592)) || \old(initial_state) == 8544) || ((s__state == 8528 && blastFlag <= 2) && s__hit == 0)) || ((((((((((!(8545 == s__state) && !(8673 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8561) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8448)) || \old(initial_state) == 8496) || ((s__state <= 8640 && blastFlag == 1) && 8640 <= s__state)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag == 1)) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8673) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && s__hit == 0)) || (((blastFlag <= 2 && s__state <= 8656) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((s__state <= 8640 && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0))) || \old(initial_state) == 8672) || \old(initial_state) == 8560) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8560)) || (blastFlag <= 2 && s__state <= 3)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8640)) || (((blastFlag <= 2 && s__hit == 0) && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || ((blastFlag <= 2 && s__hit == 0) && s__state == 8512)) || (((((((((((((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(\old(initial_state) == 8560)) && !(8545 == s__state)) && !(\old(initial_state) == 8448)) && !(8544 == s__state)) && !(\old(initial_state) == 12292)) && 8512 <= s__state) && s__state <= 8640) && !(\old(initial_state) == 8544)) && blastFlag == 1) && !(\old(initial_state) == 8561)) && !(8561 == s__state)) && !(\old(initial_state) == 8497)) && !(\old(initial_state) == 8496)) && !(\old(initial_state) == 8672)) && s__state == 8608)) || ((((s__s3__tmp__next_state___0 <= 3 && s__hit == 0) && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || \old(initial_state) == 8656) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || (((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && blastFlag == 0) && 8512 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (s__state <= 8576 && ((!(8545 == s__state) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1)) || ((s__state <= 8576 && s__hit == 0) && ((blastFlag <= 2 && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && s__hit == 0) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((blastFlag <= 2 && !(8672 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8673) || (((((!(8672 == s__state) && blastFlag <= 3) && s__s3__tmp__next_state___0 <= 8640) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || (((!(8672 == s__state) && blastFlag == 1) && s__state <= 8672) && 8656 <= s__state)) || ((((blastFlag <= 2 && !(8672 == s__state)) && !(s__hit == 0)) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || (((!(8672 == s__state) && blastFlag == 0) && s__state <= 8672) && 8656 <= s__state)) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || !(8672 == s__state)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && !(8561 == s__state)) && blastFlag == 0) || \old(initial_state) == 8480) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (s__state <= 8576 && ((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || (((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && !(8561 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || (s__state <= 8576 && (8512 <= s__state && blastFlag == 1) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state))) || ((s__state <= 8576 && blastFlag <= 2 && 8512 <= s__state && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__hit == 0)) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || (((blastFlag == 0 && 8512 <= s__state) && ((((((!(\old(initial_state) == 8673) && !(\old(initial_state) == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(\old(initial_state) == 8448)) && !(8481 == s__state)) && s__state <= 8576)) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || ((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__hit == 0) && s__state <= 8640) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8673) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && blastFlag == 1) && !(8561 == s__state))) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || ((((((!(8560 == s__state) && !(8545 == s__state)) && !(8544 == s__state)) && 8512 <= s__state) && s__state <= 8640) && !(8561 == s__state)) && blastFlag == 0)) || \old(initial_state) == 8656) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((((\old(initial_state) == 8480 || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || \old(initial_state) == 8561) || \old(initial_state) == 8560) || (((s__state <= 8576 && s__hit == 0) && blastFlag <= 2 && (((((((!(8560 == s__state) && !(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__s3__tmp__next_state___0 <= 8576)) || ((s__state <= 8576 && ((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag == 1) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__s3__tmp__next_state___0 <= 8576)) || \old(initial_state) == 8656) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == 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)) && blastFlag == 0) && !(12292 == s__state))) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8657 == s__state) && !(8656 == s__state)) && blastFlag == 0) && !(12292 == s__state)) && 8656 <= s__state) || \old(initial_state) == 8480) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8448) || \old(initial_state) == 8497) || \old(initial_state) == 8673) || \old(initial_state) == 8656) || \old(initial_state) == 12292) || \old(initial_state) == 8544) || \old(initial_state) == 8672) || (((((blastFlag <= 3 && !(8657 == s__state)) && !(8656 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && 8656 <= s__state)) || \old(initial_state) == 8545) || \old(initial_state) == 8481) || \old(initial_state) == 8657) || \old(initial_state) == 8496) || ((((!(8657 == s__state) && blastFlag == 1) && !(8656 == s__state)) && !(12292 == s__state)) && 8656 <= s__state)) || \old(initial_state) == 8561) || \old(initial_state) == 8560 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 151 locations, 1 error locations. SAFE Result, 32.1s OverallTime, 39 OverallIterations, 24 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 15.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 7879 SDtfs, 7830 SDslu, 5854 SDs, 0 SdLazy, 4975 SolverSat, 1077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6240 GetRequests, 6133 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5047occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 39 MinimizatonAttempts, 6591 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 261 NumberOfFragments, 4127 HoareAnnotationTreeSize, 32 FomulaSimplifications, 648306 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 448657 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 11812 NumberOfCodeBlocks, 11812 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 14793 ConstructedInterpolants, 0 QuantifiedInterpolants, 7250364 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5324 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 55 InterpolantComputations, 39 PerfectInterpolantSequences, 58694/58938 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...