./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/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 cfc4572bc150d8d2f9b1a5737590a88a31fdad6b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 03:47:03,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:47:03,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:47:03,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:47:03,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:47:03,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:47:03,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:47:03,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:47:03,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:47:03,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:47:03,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:47:03,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:47:03,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:47:03,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:47:03,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:47:03,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:47:03,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:47:03,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:47:03,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:47:03,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:47:03,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:47:03,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:47:03,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:47:03,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:47:03,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:47:03,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:47:03,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:47:03,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:47:03,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:47:03,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:47:03,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:47:03,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:47:03,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:47:03,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:47:03,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:47:03,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:47:03,178 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 03:47:03,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:47:03,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:47:03,186 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:47:03,186 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:47:03,186 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:47:03,186 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:47:03,186 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:47:03,186 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:47:03,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 03:47:03,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 03:47:03,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:47:03,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:47:03,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:47:03,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:47:03,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:47:03,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:47:03,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:47:03,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:47:03,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:47:03,190 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_32cba49c-fd2b-4dcd-8008-6698a213d098/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 -> cfc4572bc150d8d2f9b1a5737590a88a31fdad6b [2018-12-03 03:47:03,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:47:03,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:47:03,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:47:03,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:47:03,227 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:47:03,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-03 03:47:03,267 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/data/3093d7aeb/037fb5fca40b4a508a1bc24468abb4a2/FLAG42b98e70c [2018-12-03 03:47:03,648 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:47:03,648 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/sv-benchmarks/c/bitvector/s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-03 03:47:03,654 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/data/3093d7aeb/037fb5fca40b4a508a1bc24468abb4a2/FLAG42b98e70c [2018-12-03 03:47:03,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/data/3093d7aeb/037fb5fca40b4a508a1bc24468abb4a2 [2018-12-03 03:47:03,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:47:03,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:47:03,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:47:03,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:47:03,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:47:03,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bd7f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03, skipping insertion in model container [2018-12-03 03:47:03,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:47:03,693 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:47:03,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:47:03,811 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:47:03,872 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:47:03,880 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:47:03,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03 WrapperNode [2018-12-03 03:47:03,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:47:03,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:47:03,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:47:03,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:47:03,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:47:03,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:47:03,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:47:03,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:47:03,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... [2018-12-03 03:47:03,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:47:03,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:47:03,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:47:03,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:47:03,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:47:03,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:47:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:47:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:47:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:47:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:47:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:47:03,953 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-03 03:47:03,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-03 03:47:04,041 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 03:47:04,041 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 03:47:04,263 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:47:04,263 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 03:47:04,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:47:04 BoogieIcfgContainer [2018-12-03 03:47:04,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:47:04,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:47:04,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:47:04,265 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:47:04,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:47:03" (1/3) ... [2018-12-03 03:47:04,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382f3006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:47:04, skipping insertion in model container [2018-12-03 03:47:04,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:47:03" (2/3) ... [2018-12-03 03:47:04,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382f3006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:47:04, skipping insertion in model container [2018-12-03 03:47:04,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:47:04" (3/3) ... [2018-12-03 03:47:04,267 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-03 03:47:04,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:47:04,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 03:47:04,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 03:47:04,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:47:04,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:47:04,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:47:04,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:47:04,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:47:04,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:47:04,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:47:04,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:47:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-12-03 03:47:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 03:47:04,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:04,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:04,326 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:04,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash -459257302, now seen corresponding path program 1 times [2018-12-03 03:47:04,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:47:04,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:04,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:04,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:04,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:04,510 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-12-03 03:47:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:04,693 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2018-12-03 03:47:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:04,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-03 03:47:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:04,701 INFO L225 Difference]: With dead ends: 332 [2018-12-03 03:47:04,701 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 03:47:04,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 03:47:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2018-12-03 03:47:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 03:47:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2018-12-03 03:47:04,734 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 49 [2018-12-03 03:47:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:04,734 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2018-12-03 03:47:04,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2018-12-03 03:47:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 03:47:04,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:04,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:04,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:04,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1359139796, now seen corresponding path program 1 times [2018-12-03 03:47:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:47:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:04,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:04,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:04,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:04,800 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 5 states. [2018-12-03 03:47:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:04,967 INFO L93 Difference]: Finished difference Result 377 states and 621 transitions. [2018-12-03 03:47:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:04,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 03:47:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:04,970 INFO L225 Difference]: With dead ends: 377 [2018-12-03 03:47:04,970 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 03:47:04,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 03:47:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2018-12-03 03:47:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 03:47:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2018-12-03 03:47:04,983 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 50 [2018-12-03 03:47:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:04,984 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2018-12-03 03:47:04,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2018-12-03 03:47:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 03:47:04,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:04,986 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:04,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -250817147, now seen corresponding path program 1 times [2018-12-03 03:47:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:04,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:47:05,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,048 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand 5 states. [2018-12-03 03:47:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:05,205 INFO L93 Difference]: Finished difference Result 442 states and 747 transitions. [2018-12-03 03:47:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:05,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-03 03:47:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:05,207 INFO L225 Difference]: With dead ends: 442 [2018-12-03 03:47:05,207 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 03:47:05,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 03:47:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-03 03:47:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 03:47:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 409 transitions. [2018-12-03 03:47:05,217 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 409 transitions. Word has length 77 [2018-12-03 03:47:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:05,217 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 409 transitions. [2018-12-03 03:47:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 409 transitions. [2018-12-03 03:47:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 03:47:05,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:05,219 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:05,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:05,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash -508376229, now seen corresponding path program 1 times [2018-12-03 03:47:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:05,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:05,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,263 INFO L87 Difference]: Start difference. First operand 243 states and 409 transitions. Second operand 5 states. [2018-12-03 03:47:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:05,354 INFO L93 Difference]: Finished difference Result 490 states and 829 transitions. [2018-12-03 03:47:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:05,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 03:47:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:05,355 INFO L225 Difference]: With dead ends: 490 [2018-12-03 03:47:05,355 INFO L226 Difference]: Without dead ends: 260 [2018-12-03 03:47:05,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-03 03:47:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-12-03 03:47:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-12-03 03:47:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 432 transitions. [2018-12-03 03:47:05,367 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 432 transitions. Word has length 89 [2018-12-03 03:47:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:05,367 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 432 transitions. [2018-12-03 03:47:05,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 432 transitions. [2018-12-03 03:47:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 03:47:05,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:05,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:05,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:05,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 384668356, now seen corresponding path program 1 times [2018-12-03 03:47:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:47:05,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,407 INFO L87 Difference]: Start difference. First operand 258 states and 432 transitions. Second operand 5 states. [2018-12-03 03:47:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:05,530 INFO L93 Difference]: Finished difference Result 549 states and 928 transitions. [2018-12-03 03:47:05,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:05,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 03:47:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:05,531 INFO L225 Difference]: With dead ends: 549 [2018-12-03 03:47:05,531 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 03:47:05,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 03:47:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2018-12-03 03:47:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 03:47:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 506 transitions. [2018-12-03 03:47:05,540 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 506 transitions. Word has length 89 [2018-12-03 03:47:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:05,541 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 506 transitions. [2018-12-03 03:47:05,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 506 transitions. [2018-12-03 03:47:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 03:47:05,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:05,542 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:05,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:05,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:05,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1150340194, now seen corresponding path program 1 times [2018-12-03 03:47:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:05,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:05,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:05,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,585 INFO L87 Difference]: Start difference. First operand 300 states and 506 transitions. Second operand 5 states. [2018-12-03 03:47:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:05,692 INFO L93 Difference]: Finished difference Result 589 states and 997 transitions. [2018-12-03 03:47:05,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:05,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-03 03:47:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:05,694 INFO L225 Difference]: With dead ends: 589 [2018-12-03 03:47:05,694 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 03:47:05,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 03:47:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-12-03 03:47:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 03:47:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 502 transitions. [2018-12-03 03:47:05,703 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 502 transitions. Word has length 90 [2018-12-03 03:47:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:05,703 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 502 transitions. [2018-12-03 03:47:05,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 502 transitions. [2018-12-03 03:47:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 03:47:05,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:05,705 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:05,705 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:05,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 12513126, now seen corresponding path program 1 times [2018-12-03 03:47:05,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:05,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:05,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:47:05,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,751 INFO L87 Difference]: Start difference. First operand 300 states and 502 transitions. Second operand 5 states. [2018-12-03 03:47:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:05,881 INFO L93 Difference]: Finished difference Result 591 states and 992 transitions. [2018-12-03 03:47:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:05,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-03 03:47:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:05,882 INFO L225 Difference]: With dead ends: 591 [2018-12-03 03:47:05,882 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 03:47:05,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 03:47:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2018-12-03 03:47:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-03 03:47:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 497 transitions. [2018-12-03 03:47:05,890 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 497 transitions. Word has length 90 [2018-12-03 03:47:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:05,890 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 497 transitions. [2018-12-03 03:47:05,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 497 transitions. [2018-12-03 03:47:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 03:47:05,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:05,891 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:05,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:05,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1256654058, now seen corresponding path program 1 times [2018-12-03 03:47:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:05,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 03:47:05,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:05,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:05,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:05,919 INFO L87 Difference]: Start difference. First operand 298 states and 497 transitions. Second operand 5 states. [2018-12-03 03:47:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,018 INFO L93 Difference]: Finished difference Result 591 states and 988 transitions. [2018-12-03 03:47:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-03 03:47:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,019 INFO L225 Difference]: With dead ends: 591 [2018-12-03 03:47:06,019 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 03:47:06,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 03:47:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-03 03:47:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 03:47:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2018-12-03 03:47:06,026 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 101 [2018-12-03 03:47:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,026 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2018-12-03 03:47:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2018-12-03 03:47:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 03:47:06,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,027 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,027 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash -315055682, now seen corresponding path program 1 times [2018-12-03 03:47:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:06,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,062 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 5 states. [2018-12-03 03:47:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,171 INFO L93 Difference]: Finished difference Result 630 states and 1040 transitions. [2018-12-03 03:47:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-03 03:47:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,172 INFO L225 Difference]: With dead ends: 630 [2018-12-03 03:47:06,172 INFO L226 Difference]: Without dead ends: 337 [2018-12-03 03:47:06,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-12-03 03:47:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-03 03:47:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-12-03 03:47:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 03:47:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2018-12-03 03:47:06,180 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 103 [2018-12-03 03:47:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,181 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2018-12-03 03:47:06,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2018-12-03 03:47:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 03:47:06,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,182 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,182 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1874973505, now seen corresponding path program 1 times [2018-12-03 03:47:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,217 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand 5 states. [2018-12-03 03:47:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,319 INFO L93 Difference]: Finished difference Result 691 states and 1140 transitions. [2018-12-03 03:47:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 03:47:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,320 INFO L225 Difference]: With dead ends: 691 [2018-12-03 03:47:06,320 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 03:47:06,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 03:47:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-12-03 03:47:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-03 03:47:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 591 transitions. [2018-12-03 03:47:06,329 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 591 transitions. Word has length 104 [2018-12-03 03:47:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,329 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 591 transitions. [2018-12-03 03:47:06,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 591 transitions. [2018-12-03 03:47:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 03:47:06,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,330 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,330 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash -411681051, now seen corresponding path program 1 times [2018-12-03 03:47:06,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:06,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,358 INFO L87 Difference]: Start difference. First operand 362 states and 591 transitions. Second operand 5 states. [2018-12-03 03:47:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,465 INFO L93 Difference]: Finished difference Result 713 states and 1167 transitions. [2018-12-03 03:47:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 03:47:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,466 INFO L225 Difference]: With dead ends: 713 [2018-12-03 03:47:06,466 INFO L226 Difference]: Without dead ends: 364 [2018-12-03 03:47:06,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-03 03:47:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-12-03 03:47:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-03 03:47:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2018-12-03 03:47:06,474 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 104 [2018-12-03 03:47:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,475 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2018-12-03 03:47:06,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2018-12-03 03:47:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 03:47:06,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,475 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1317457818, now seen corresponding path program 1 times [2018-12-03 03:47:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 03:47:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,508 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand 5 states. [2018-12-03 03:47:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,605 INFO L93 Difference]: Finished difference Result 718 states and 1169 transitions. [2018-12-03 03:47:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-03 03:47:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,606 INFO L225 Difference]: With dead ends: 718 [2018-12-03 03:47:06,606 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 03:47:06,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 03:47:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-12-03 03:47:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-03 03:47:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2018-12-03 03:47:06,615 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 105 [2018-12-03 03:47:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,615 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2018-12-03 03:47:06,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2018-12-03 03:47:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 03:47:06,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,617 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,617 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,617 INFO L82 PathProgramCache]: Analyzing trace with hash -817214863, now seen corresponding path program 1 times [2018-12-03 03:47:06,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 03:47:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,660 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand 5 states. [2018-12-03 03:47:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,787 INFO L93 Difference]: Finished difference Result 736 states and 1188 transitions. [2018-12-03 03:47:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-03 03:47:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,789 INFO L225 Difference]: With dead ends: 736 [2018-12-03 03:47:06,789 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 03:47:06,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 03:47:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-12-03 03:47:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-03 03:47:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2018-12-03 03:47:06,800 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 110 [2018-12-03 03:47:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,800 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2018-12-03 03:47:06,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2018-12-03 03:47:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 03:47:06,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,801 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,802 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1429215766, now seen corresponding path program 1 times [2018-12-03 03:47:06,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-03 03:47:06,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:06,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:06,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:06,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:06,842 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand 5 states. [2018-12-03 03:47:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:06,982 INFO L93 Difference]: Finished difference Result 757 states and 1211 transitions. [2018-12-03 03:47:06,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:06,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-03 03:47:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:06,983 INFO L225 Difference]: With dead ends: 757 [2018-12-03 03:47:06,983 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 03:47:06,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 03:47:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-12-03 03:47:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-03 03:47:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2018-12-03 03:47:06,992 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 111 [2018-12-03 03:47:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:06,992 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2018-12-03 03:47:06,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2018-12-03 03:47:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 03:47:06,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:06,993 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:06,993 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:06,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1449286990, now seen corresponding path program 1 times [2018-12-03 03:47:06,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:06,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:06,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:06,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 03:47:07,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:07,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:07,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:07,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:07,018 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand 3 states. [2018-12-03 03:47:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:07,057 INFO L93 Difference]: Finished difference Result 753 states and 1193 transitions. [2018-12-03 03:47:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:07,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-12-03 03:47:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:07,059 INFO L225 Difference]: With dead ends: 753 [2018-12-03 03:47:07,059 INFO L226 Difference]: Without dead ends: 751 [2018-12-03 03:47:07,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-12-03 03:47:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2018-12-03 03:47:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2018-12-03 03:47:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1191 transitions. [2018-12-03 03:47:07,087 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1191 transitions. Word has length 126 [2018-12-03 03:47:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:07,087 INFO L480 AbstractCegarLoop]: Abstraction has 751 states and 1191 transitions. [2018-12-03 03:47:07,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1191 transitions. [2018-12-03 03:47:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 03:47:07,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:07,089 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:07,089 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:07,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1360581389, now seen corresponding path program 1 times [2018-12-03 03:47:07,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:07,097 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 03:47:07,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 03:47:07,097 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 03:47:07,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:07,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 03:47:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:07,136 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-12-03 03:47:07,138 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [93], [98], [103], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:07,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:07,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:07,288 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:47:07,289 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 203 root evaluator evaluations with a maximum evaluation depth of 3. Performed 203 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 84 variables. [2018-12-03 03:47:07,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:07,302 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:47:07,420 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 81.01% of their original sizes. [2018-12-03 03:47:07,420 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:47:07,446 INFO L418 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-12-03 03:47:07,446 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:47:07,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:07,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 03:47:07,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:07,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 03:47:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 03:47:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:47:07,447 INFO L87 Difference]: Start difference. First operand 751 states and 1191 transitions. Second operand 5 states. [2018-12-03 03:47:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:07,734 INFO L93 Difference]: Finished difference Result 1502 states and 2385 transitions. [2018-12-03 03:47:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:07,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-03 03:47:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:07,736 INFO L225 Difference]: With dead ends: 1502 [2018-12-03 03:47:07,736 INFO L226 Difference]: Without dead ends: 764 [2018-12-03 03:47:07,737 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-12-03 03:47:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-12-03 03:47:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-03 03:47:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1204 transitions. [2018-12-03 03:47:07,754 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1204 transitions. Word has length 127 [2018-12-03 03:47:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:07,754 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 1204 transitions. [2018-12-03 03:47:07,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 03:47:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1204 transitions. [2018-12-03 03:47:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 03:47:07,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:07,756 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:07,756 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:07,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1941520082, now seen corresponding path program 1 times [2018-12-03 03:47:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:07,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 03:47:07,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:07,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:07,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:07,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:07,783 INFO L87 Difference]: Start difference. First operand 764 states and 1204 transitions. Second operand 3 states. [2018-12-03 03:47:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:07,877 INFO L93 Difference]: Finished difference Result 1510 states and 2390 transitions. [2018-12-03 03:47:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:07,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-12-03 03:47:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:07,880 INFO L225 Difference]: With dead ends: 1510 [2018-12-03 03:47:07,880 INFO L226 Difference]: Without dead ends: 772 [2018-12-03 03:47:07,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-12-03 03:47:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 764. [2018-12-03 03:47:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-12-03 03:47:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1186 transitions. [2018-12-03 03:47:07,906 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1186 transitions. Word has length 143 [2018-12-03 03:47:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:07,906 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 1186 transitions. [2018-12-03 03:47:07,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1186 transitions. [2018-12-03 03:47:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 03:47:07,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:07,907 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:07,908 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:07,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1426466207, now seen corresponding path program 1 times [2018-12-03 03:47:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:07,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:07,912 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 03:47:07,912 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 03:47:07,912 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 03:47:07,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:07,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 03:47:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:07,958 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-03 03:47:07,958 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [502], [508], [513], [515], [518], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:07,961 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:07,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:08,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:08,048 INFO L272 AbstractInterpreter]: Visited 70 different actions 111 times. Merged at 23 different actions 38 times. Never widened. Performed 522 root evaluator evaluations with a maximum evaluation depth of 3. Performed 522 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 86 variables. [2018-12-03 03:47:08,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:08,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:08,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:08,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:08,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:08,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 03:47:08,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 03:47:08,181 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:08,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-03 03:47:08,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:08,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,182 INFO L87 Difference]: Start difference. First operand 764 states and 1186 transitions. Second operand 3 states. [2018-12-03 03:47:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:08,227 INFO L93 Difference]: Finished difference Result 1870 states and 2919 transitions. [2018-12-03 03:47:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:08,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-03 03:47:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:08,229 INFO L225 Difference]: With dead ends: 1870 [2018-12-03 03:47:08,230 INFO L226 Difference]: Without dead ends: 1132 [2018-12-03 03:47:08,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-12-03 03:47:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2018-12-03 03:47:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 03:47:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1762 transitions. [2018-12-03 03:47:08,259 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1762 transitions. Word has length 164 [2018-12-03 03:47:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:08,259 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1762 transitions. [2018-12-03 03:47:08,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1762 transitions. [2018-12-03 03:47:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 03:47:08,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:08,261 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:08,261 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:08,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash -391989381, now seen corresponding path program 1 times [2018-12-03 03:47:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-03 03:47:08,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:08,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:08,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:08,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:08,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:08,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,302 INFO L87 Difference]: Start difference. First operand 1132 states and 1762 transitions. Second operand 3 states. [2018-12-03 03:47:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:08,445 INFO L93 Difference]: Finished difference Result 2265 states and 3527 transitions. [2018-12-03 03:47:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:08,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-03 03:47:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:08,448 INFO L225 Difference]: With dead ends: 2265 [2018-12-03 03:47:08,449 INFO L226 Difference]: Without dead ends: 1159 [2018-12-03 03:47:08,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-12-03 03:47:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1132. [2018-12-03 03:47:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 03:47:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1708 transitions. [2018-12-03 03:47:08,482 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1708 transitions. Word has length 204 [2018-12-03 03:47:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:08,482 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1708 transitions. [2018-12-03 03:47:08,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1708 transitions. [2018-12-03 03:47:08,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-03 03:47:08,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:08,485 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:08,485 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:08,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash -945704107, now seen corresponding path program 1 times [2018-12-03 03:47:08,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-12-03 03:47:08,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:08,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:08,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:08,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:08,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,534 INFO L87 Difference]: Start difference. First operand 1132 states and 1708 transitions. Second operand 3 states. [2018-12-03 03:47:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:08,671 INFO L93 Difference]: Finished difference Result 2276 states and 3430 transitions. [2018-12-03 03:47:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:08,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-12-03 03:47:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:08,674 INFO L225 Difference]: With dead ends: 2276 [2018-12-03 03:47:08,674 INFO L226 Difference]: Without dead ends: 1170 [2018-12-03 03:47:08,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-12-03 03:47:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1132. [2018-12-03 03:47:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 03:47:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1666 transitions. [2018-12-03 03:47:08,705 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1666 transitions. Word has length 217 [2018-12-03 03:47:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:08,706 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1666 transitions. [2018-12-03 03:47:08,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1666 transitions. [2018-12-03 03:47:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-03 03:47:08,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:08,708 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:08,708 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:08,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1110401752, now seen corresponding path program 1 times [2018-12-03 03:47:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:08,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:08,718 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 03:47:08,718 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 03:47:08,718 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 03:47:08,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 03:47:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:08,773 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2018-12-03 03:47:08,773 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [309], [313], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:08,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:08,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:08,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:08,919 INFO L272 AbstractInterpreter]: Visited 78 different actions 181 times. Merged at 59 different actions 94 times. Never widened. Performed 858 root evaluator evaluations with a maximum evaluation depth of 8. Performed 858 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 13 fixpoints after 10 different actions. Largest state had 86 variables. [2018-12-03 03:47:08,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:08,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:08,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:08,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:08,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:08,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:08,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-03 03:47:08,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-03 03:47:09,074 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:09,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-03 03:47:09,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:09,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:09,075 INFO L87 Difference]: Start difference. First operand 1132 states and 1666 transitions. Second operand 3 states. [2018-12-03 03:47:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:09,149 INFO L93 Difference]: Finished difference Result 3332 states and 4926 transitions. [2018-12-03 03:47:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:09,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2018-12-03 03:47:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:09,155 INFO L225 Difference]: With dead ends: 3332 [2018-12-03 03:47:09,156 INFO L226 Difference]: Without dead ends: 2226 [2018-12-03 03:47:09,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-12-03 03:47:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2224. [2018-12-03 03:47:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-03 03:47:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3280 transitions. [2018-12-03 03:47:09,212 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3280 transitions. Word has length 246 [2018-12-03 03:47:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:09,213 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 3280 transitions. [2018-12-03 03:47:09,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3280 transitions. [2018-12-03 03:47:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-03 03:47:09,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:09,216 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:09,216 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:09,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1423055184, now seen corresponding path program 1 times [2018-12-03 03:47:09,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:09,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:09,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:09,223 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 03:47:09,223 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 03:47:09,223 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 03:47:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:09,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 03:47:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:09,267 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-12-03 03:47:09,267 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:09,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:09,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:09,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:09,448 INFO L272 AbstractInterpreter]: Visited 80 different actions 273 times. Merged at 68 different actions 173 times. Widened at 4 different actions 4 times. Performed 1200 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1200 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 23 fixpoints after 12 different actions. Largest state had 86 variables. [2018-12-03 03:47:09,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:09,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:09,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:09,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:09,467 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:09,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 03:47:09,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-12-03 03:47:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:09,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-12-03 03:47:09,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:09,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:09,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:09,618 INFO L87 Difference]: Start difference. First operand 2224 states and 3280 transitions. Second operand 3 states. [2018-12-03 03:47:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:09,775 INFO L93 Difference]: Finished difference Result 4422 states and 6530 transitions. [2018-12-03 03:47:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-12-03 03:47:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:09,779 INFO L225 Difference]: With dead ends: 4422 [2018-12-03 03:47:09,779 INFO L226 Difference]: Without dead ends: 2224 [2018-12-03 03:47:09,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-12-03 03:47:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2224. [2018-12-03 03:47:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-12-03 03:47:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3214 transitions. [2018-12-03 03:47:09,825 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3214 transitions. Word has length 283 [2018-12-03 03:47:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:09,825 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 3214 transitions. [2018-12-03 03:47:09,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3214 transitions. [2018-12-03 03:47:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-03 03:47:09,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:09,828 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:09,828 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:09,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash 464693141, now seen corresponding path program 1 times [2018-12-03 03:47:09,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:09,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:09,835 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 03:47:09,836 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 03:47:09,836 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 03:47:09,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:09,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 03:47:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:09,888 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-12-03 03:47:09,888 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [287], [293], [295], [298], [300], [306], [309], [313], [436], [438], [472], [475], [483], [486], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [528], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:09,890 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:09,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:10,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:10,088 INFO L272 AbstractInterpreter]: Visited 83 different actions 360 times. Merged at 70 different actions 247 times. Widened at 5 different actions 6 times. Performed 1568 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1568 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 35 fixpoints after 14 different actions. Largest state had 86 variables. [2018-12-03 03:47:10,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:10,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:10,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:10,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:10,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:10,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-03 03:47:10,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-12-03 03:47:10,256 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:10,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-12-03 03:47:10,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:10,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:10,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:10,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:47:10,258 INFO L87 Difference]: Start difference. First operand 2224 states and 3214 transitions. Second operand 3 states. [2018-12-03 03:47:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:10,407 INFO L93 Difference]: Finished difference Result 4656 states and 6764 transitions. [2018-12-03 03:47:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:10,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-12-03 03:47:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:10,410 INFO L225 Difference]: With dead ends: 4656 [2018-12-03 03:47:10,410 INFO L226 Difference]: Without dead ends: 1481 [2018-12-03 03:47:10,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:47:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-12-03 03:47:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2018-12-03 03:47:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-12-03 03:47:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2109 transitions. [2018-12-03 03:47:10,443 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2109 transitions. Word has length 311 [2018-12-03 03:47:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:10,443 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2109 transitions. [2018-12-03 03:47:10,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2109 transitions. [2018-12-03 03:47:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-03 03:47:10,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:10,445 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:10,445 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:10,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:10,445 INFO L82 PathProgramCache]: Analyzing trace with hash -60637526, now seen corresponding path program 1 times [2018-12-03 03:47:10,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-12-03 03:47:10,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:10,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:10,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:10,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:10,502 INFO L87 Difference]: Start difference. First operand 1481 states and 2109 transitions. Second operand 3 states. [2018-12-03 03:47:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:10,619 INFO L93 Difference]: Finished difference Result 3017 states and 4306 transitions. [2018-12-03 03:47:10,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:10,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-12-03 03:47:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:10,623 INFO L225 Difference]: With dead ends: 3017 [2018-12-03 03:47:10,623 INFO L226 Difference]: Without dead ends: 1562 [2018-12-03 03:47:10,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-12-03 03:47:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1550. [2018-12-03 03:47:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2018-12-03 03:47:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2193 transitions. [2018-12-03 03:47:10,673 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2193 transitions. Word has length 312 [2018-12-03 03:47:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 1550 states and 2193 transitions. [2018-12-03 03:47:10,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2193 transitions. [2018-12-03 03:47:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-03 03:47:10,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:10,677 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:10,677 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:10,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1485741080, now seen corresponding path program 1 times [2018-12-03 03:47:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 03:47:10,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:10,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:10,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:10,729 INFO L87 Difference]: Start difference. First operand 1550 states and 2193 transitions. Second operand 3 states. [2018-12-03 03:47:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:10,846 INFO L93 Difference]: Finished difference Result 3222 states and 4588 transitions. [2018-12-03 03:47:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:10,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2018-12-03 03:47:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:10,849 INFO L225 Difference]: With dead ends: 3222 [2018-12-03 03:47:10,849 INFO L226 Difference]: Without dead ends: 1698 [2018-12-03 03:47:10,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-12-03 03:47:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1650. [2018-12-03 03:47:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-12-03 03:47:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2313 transitions. [2018-12-03 03:47:10,889 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2313 transitions. Word has length 332 [2018-12-03 03:47:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:10,890 INFO L480 AbstractCegarLoop]: Abstraction has 1650 states and 2313 transitions. [2018-12-03 03:47:10,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2313 transitions. [2018-12-03 03:47:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-03 03:47:10,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:10,892 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:10,892 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:10,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 432297452, now seen corresponding path program 1 times [2018-12-03 03:47:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:10,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-12-03 03:47:10,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:10,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:10,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:10,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:10,966 INFO L87 Difference]: Start difference. First operand 1650 states and 2313 transitions. Second operand 3 states. [2018-12-03 03:47:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:11,084 INFO L93 Difference]: Finished difference Result 3302 states and 4644 transitions. [2018-12-03 03:47:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:11,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2018-12-03 03:47:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:11,088 INFO L225 Difference]: With dead ends: 3302 [2018-12-03 03:47:11,089 INFO L226 Difference]: Without dead ends: 1678 [2018-12-03 03:47:11,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-12-03 03:47:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1650. [2018-12-03 03:47:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-12-03 03:47:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2273 transitions. [2018-12-03 03:47:11,122 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2273 transitions. Word has length 358 [2018-12-03 03:47:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 1650 states and 2273 transitions. [2018-12-03 03:47:11,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2273 transitions. [2018-12-03 03:47:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-03 03:47:11,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:11,124 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:11,124 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:11,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 222053756, now seen corresponding path program 1 times [2018-12-03 03:47:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:11,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:11,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 03:47:11,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:11,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:47:11,188 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-12-03 03:47:11,188 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [472], [475], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:11,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:11,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:11,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:11,336 INFO L272 AbstractInterpreter]: Visited 97 different actions 309 times. Merged at 81 different actions 190 times. Widened at 2 different actions 2 times. Performed 1338 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1338 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 29 fixpoints after 15 different actions. Largest state had 88 variables. [2018-12-03 03:47:11,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:11,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:11,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:11,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:11,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:11,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:11,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 03:47:11,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 03:47:11,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:47:11,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 03:47:11,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:47:11,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:47:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:47:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:11,525 INFO L87 Difference]: Start difference. First operand 1650 states and 2273 transitions. Second operand 4 states. [2018-12-03 03:47:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:11,810 INFO L93 Difference]: Finished difference Result 4182 states and 5761 transitions. [2018-12-03 03:47:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:47:11,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-12-03 03:47:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:11,816 INFO L225 Difference]: With dead ends: 4182 [2018-12-03 03:47:11,816 INFO L226 Difference]: Without dead ends: 2476 [2018-12-03 03:47:11,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:47:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2018-12-03 03:47:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 1735. [2018-12-03 03:47:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-03 03:47:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2368 transitions. [2018-12-03 03:47:11,861 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2368 transitions. Word has length 375 [2018-12-03 03:47:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:11,861 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2368 transitions. [2018-12-03 03:47:11,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:47:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2368 transitions. [2018-12-03 03:47:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-12-03 03:47:11,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:11,863 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:11,863 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:11,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1893965958, now seen corresponding path program 1 times [2018-12-03 03:47:11,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:11,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:11,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-12-03 03:47:11,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:11,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:11,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:11,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:11,969 INFO L87 Difference]: Start difference. First operand 1735 states and 2368 transitions. Second operand 3 states. [2018-12-03 03:47:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:12,098 INFO L93 Difference]: Finished difference Result 3452 states and 4714 transitions. [2018-12-03 03:47:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:12,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2018-12-03 03:47:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:12,103 INFO L225 Difference]: With dead ends: 3452 [2018-12-03 03:47:12,103 INFO L226 Difference]: Without dead ends: 1743 [2018-12-03 03:47:12,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2018-12-03 03:47:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1735. [2018-12-03 03:47:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-03 03:47:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2328 transitions. [2018-12-03 03:47:12,146 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2328 transitions. Word has length 443 [2018-12-03 03:47:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:12,146 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2328 transitions. [2018-12-03 03:47:12,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2328 transitions. [2018-12-03 03:47:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-12-03 03:47:12,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:12,148 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:12,148 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:12,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash 756608049, now seen corresponding path program 1 times [2018-12-03 03:47:12,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-12-03 03:47:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:12,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:12,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:12,233 INFO L87 Difference]: Start difference. First operand 1735 states and 2328 transitions. Second operand 3 states. [2018-12-03 03:47:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:12,332 INFO L93 Difference]: Finished difference Result 3588 states and 4838 transitions. [2018-12-03 03:47:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:12,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2018-12-03 03:47:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:12,335 INFO L225 Difference]: With dead ends: 3588 [2018-12-03 03:47:12,336 INFO L226 Difference]: Without dead ends: 1879 [2018-12-03 03:47:12,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-12-03 03:47:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1871. [2018-12-03 03:47:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2018-12-03 03:47:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2484 transitions. [2018-12-03 03:47:12,370 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2484 transitions. Word has length 475 [2018-12-03 03:47:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:12,371 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 2484 transitions. [2018-12-03 03:47:12,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2484 transitions. [2018-12-03 03:47:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-12-03 03:47:12,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:12,374 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:12,374 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:12,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash -10886553, now seen corresponding path program 1 times [2018-12-03 03:47:12,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2018-12-03 03:47:12,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:47:12,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:47:12,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:47:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:47:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:47:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:12,521 INFO L87 Difference]: Start difference. First operand 1871 states and 2484 transitions. Second operand 3 states. [2018-12-03 03:47:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:12,650 INFO L93 Difference]: Finished difference Result 3868 states and 5166 transitions. [2018-12-03 03:47:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:47:12,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2018-12-03 03:47:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:12,653 INFO L225 Difference]: With dead ends: 3868 [2018-12-03 03:47:12,653 INFO L226 Difference]: Without dead ends: 2023 [2018-12-03 03:47:12,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:47:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-03 03:47:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2015. [2018-12-03 03:47:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2018-12-03 03:47:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2648 transitions. [2018-12-03 03:47:12,691 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2648 transitions. Word has length 537 [2018-12-03 03:47:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:12,692 INFO L480 AbstractCegarLoop]: Abstraction has 2015 states and 2648 transitions. [2018-12-03 03:47:12,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:47:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2648 transitions. [2018-12-03 03:47:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-03 03:47:12,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:47:12,694 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:47:12,694 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:47:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1755141137, now seen corresponding path program 1 times [2018-12-03 03:47:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:47:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:47:12,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:47:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-03 03:47:12,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:12,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:47:12,822 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 604 with the following transitions: [2018-12-03 03:47:12,822 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [282], [285], [293], [295], [298], [306], [311], [313], [317], [326], [328], [331], [337], [366], [371], [381], [385], [396], [407], [409], [414], [436], [438], [440], [445], [450], [455], [458], [463], [465], [470], [472], [475], [477], [483], [488], [490], [492], [497], [500], [502], [508], [513], [515], [518], [520], [525], [530], [532], [586], [588], [601], [606], [607], [608], [610] [2018-12-03 03:47:12,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:47:12,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:47:13,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:47:13,020 INFO L272 AbstractInterpreter]: Visited 109 different actions 348 times. Merged at 90 different actions 210 times. Widened at 3 different actions 3 times. Performed 1560 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1560 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 40 fixpoints after 19 different actions. Largest state had 92 variables. [2018-12-03 03:47:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:47:13,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:47:13,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:47:13,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:47:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:47:13,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:47:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:47:13,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:47:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-03 03:47:13,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:47:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2018-12-03 03:47:13,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:47:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 03:47:13,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:47:13,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:47:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:47:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:47:13,330 INFO L87 Difference]: Start difference. First operand 2015 states and 2648 transitions. Second operand 4 states. [2018-12-03 03:47:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:47:13,457 INFO L93 Difference]: Finished difference Result 2675 states and 3517 transitions. [2018-12-03 03:47:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:47:13,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2018-12-03 03:47:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:47:13,458 INFO L225 Difference]: With dead ends: 2675 [2018-12-03 03:47:13,458 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 03:47:13,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:47:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 03:47:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 03:47:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 03:47:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 03:47:13,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2018-12-03 03:47:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:47:13,460 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 03:47:13,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:47:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 03:47:13,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 03:47:13,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 03:47:13,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:13,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:47:14,014 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-03 03:47:14,161 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2018-12-03 03:47:14,290 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-12-03 03:47:14,427 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2018-12-03 03:47:14,570 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-03 03:47:14,777 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-03 03:47:15,002 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-03 03:47:15,141 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-03 03:47:15,289 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-03 03:47:15,469 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-03 03:47:15,643 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-12-03 03:47:15,865 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 24 [2018-12-03 03:47:16,103 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-03 03:47:16,270 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-12-03 03:47:16,513 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-12-03 03:47:16,873 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 51 [2018-12-03 03:47:17,034 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2018-12-03 03:47:17,404 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 51 [2018-12-03 03:47:17,586 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-12-03 03:47:17,588 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 03:47:17,589 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 674 685) the Hoare annotation is: true [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 674 685) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L444 ceAbstractionStarter]: At program point L681(line 681) the Hoare annotation is: (= main_~s~0 8464) [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 674 685) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point L681-1(line 681) no Hoare annotation was computed. [2018-12-03 03:47:17,589 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L444 ceAbstractionStarter]: At program point L201(lines 197 591) the Hoare annotation is: (or (and (<= 8672 ssl3_accept_~s__state~0) (<= ssl3_accept_~blastFlag~0 3) (not (= 12292 ssl3_accept_~s__state~0))) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-03 03:47:17,590 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 623) the Hoare annotation is: (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and (not (= 8673 ssl3_accept_~s__state~0)) (<= 8672 ssl3_accept_~s__state~0) (not (= 8672 ssl3_accept_~s__state~0)) (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)))) [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 503) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L499-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 589) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 600) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 611) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 622) no Hoare annotation was computed. [2018-12-03 03:47:17,590 INFO L444 ceAbstractionStarter]: At program point L204(lines 203 589) the Hoare annotation is: (or (not (= 8672 ssl3_accept_~s__state~0)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-03 03:47:17,591 INFO L444 ceAbstractionStarter]: At program point L171(lines 167 601) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-03 03:47:17,591 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 612) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8544 ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ssl3_accept_~s__state~0))) (.cse5 (not (= 8480 ssl3_accept_~s__state~0))) (.cse6 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (not (= 8672 ssl3_accept_~s__state~0)) .cse2 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (and .cse0 .cse1 (<= ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~s__state~0 8576)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 579) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L569-1(lines 569 579) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 599) no Hoare annotation was computed. [2018-12-03 03:47:17,591 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 610) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 621) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 588) the Hoare annotation is: (or (not (= 8672 ssl3_accept_~s__state~0)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L451 ceAbstractionStarter]: At program point L670(lines 63 672) the Hoare annotation is: true [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 543) no Hoare annotation was computed. [2018-12-03 03:47:17,592 INFO L444 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L340-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L451 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 8 673) the Hoare annotation is: true [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 576) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 598) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 609) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 620) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2018-12-03 03:47:17,593 INFO L444 ceAbstractionStarter]: At program point L177(lines 173 599) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-03 03:47:17,593 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 610) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L444 ceAbstractionStarter]: At program point L211(lines 104 622) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 .cse1 (not (= 8673 ssl3_accept_~s__state~0)) .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0))) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 513) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L509-2(lines 509 513) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 597) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 608) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 619) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 63 672) no Hoare annotation was computed. [2018-12-03 03:47:17,594 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 596) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 607) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 618) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2018-12-03 03:47:17,595 INFO L444 ceAbstractionStarter]: At program point L183(lines 179 597) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-12-03 03:47:17,595 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 608) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-03 03:47:17,595 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 552) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 595) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 606) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 617) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L444 ceAbstractionStarter]: At program point L549(lines 63 672) the Hoare annotation is: (not (= |ssl3_accept_#in~initial_state| 8464)) [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 587) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 587) no Hoare annotation was computed. [2018-12-03 03:47:17,596 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 618) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,596 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 594) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 605) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 616) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 8 673) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 524) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L448 ceAbstractionStarter]: For program point L288-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,597 INFO L444 ceAbstractionStarter]: At program point L189(lines 185 595) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8657 ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ssl3_accept_~s__state~0))) (.cse9 (not (= 8561 ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ssl3_accept_~s__state~0))) (.cse11 (not (= 8481 ssl3_accept_~s__state~0))) (.cse12 (<= ssl3_accept_~s__state~0 8672))) (or (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ssl3_accept_~s__hit~0 0)) .cse12))) [2018-12-03 03:47:17,598 INFO L444 ceAbstractionStarter]: At program point L156(lines 152 606) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,598 INFO L444 ceAbstractionStarter]: At program point L123(lines 122 616) the Hoare annotation is: (or (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8496 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464))) [2018-12-03 03:47:17,598 INFO L444 ceAbstractionStarter]: At program point L586(lines 98 654) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (not (= |ssl3_accept_#in~initial_state| 8464)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= ssl3_accept_~s__state~0 8448)) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (<= ssl3_accept_~s__state~0 3) (and .cse1 (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) .cse2) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse2))) [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 557) no Hoare annotation was computed. [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-12-03 03:47:17,598 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 593) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 604) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 615) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 8 673) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L451 ceAbstractionStarter]: At program point L655(lines 97 656) the Hoare annotation is: true [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 592) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 603) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 614) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 652) no Hoare annotation was computed. [2018-12-03 03:47:17,599 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L444 ceAbstractionStarter]: At program point L195(lines 191 593) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8672 ssl3_accept_~s__state~0))) (.cse4 (not (= 8497 ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ssl3_accept_~s__state~0))) (.cse7 (not (= 8561 ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ssl3_accept_~s__state~0))) (.cse10 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 .cse9 (not (= ssl3_accept_~s__hit~0 0)) .cse10) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 03:47:17,600 INFO L444 ceAbstractionStarter]: At program point L162(lines 158 604) the Hoare annotation is: (let ((.cse0 (and (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8544 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) .cse1 (not (= ssl3_accept_~s__hit~0 0)) .cse2 (<= ssl3_accept_~s__state~0 8672) .cse3) (and (<= ssl3_accept_~s__state~0 8576) .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 666) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 649) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 530) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L559-2(lines 559 563) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L526-2(lines 208 585) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L659(lines 659 663) no Hoare annotation was computed. [2018-12-03 03:47:17,600 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 635) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L659-2(lines 659 663) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 625 647) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L444 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 591) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 602) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 613) no Hoare annotation was computed. [2018-12-03 03:47:17,601 INFO L444 ceAbstractionStarter]: At program point L98-2(lines 98 654) the Hoare annotation is: (let ((.cse1 (<= ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (not (= |ssl3_accept_#in~initial_state| 8464)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 (= ssl3_accept_~s__state~0 8448)) (and .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ssl3_accept_~s__state~0 8576)) (<= ssl3_accept_~s__state~0 3) (and .cse1 (not (= 8545 ssl3_accept_~s__state~0)) (not (= 8497 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) .cse2) (and (<= 8672 ssl3_accept_~s__state~0) .cse0 .cse2))) [2018-12-03 03:47:17,602 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (and (not (= 8560 ssl3_accept_~s__state~0)) (not (= 8448 ssl3_accept_~s__state~0)) (not (= 8561 ssl3_accept_~s__state~0)) (not (= 8480 ssl3_accept_~s__state~0)) (not (= 8672 ssl3_accept_~s__state~0)) (not (= 8481 ssl3_accept_~s__state~0)) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)))) (.cse1 (not (= 8496 ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 3) (not (= ssl3_accept_~s__hit~0 0)) .cse1 (<= ssl3_accept_~s__state~0 8672) .cse2) (and (<= ssl3_accept_~s__state~0 8576) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2)) (not (= |ssl3_accept_#in~initial_state| 8464)))) [2018-12-03 03:47:17,602 INFO L444 ceAbstractionStarter]: At program point L165(lines 164 602) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~blastFlag~0 3)) (.cse1 (= ssl3_accept_~s__state~0 8448))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (not (= |ssl3_accept_#in~initial_state| 8464)) (and (<= ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-12-03 03:47:17,602 INFO L444 ceAbstractionStarter]: At program point L132(lines 125 615) the Hoare annotation is: (let ((.cse0 (not (= 8560 ssl3_accept_~s__state~0))) (.cse1 (not (= 8545 ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (not (= 8672 ssl3_accept_~s__state~0)) .cse3 .cse4 (<= ssl3_accept_~blastFlag~0 3) (not (= 8657 ssl3_accept_~s__state~0)) (not (= 8656 ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 (not (= ssl3_accept_~s__hit~0 0)) (<= ssl3_accept_~s__state~0 8672)) (not (= |ssl3_accept_#in~initial_state| 8464)) (and .cse0 (<= ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ssl3_accept_~s__state~0 8576)))) [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 632) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 590) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 601) no Hoare annotation was computed. [2018-12-03 03:47:17,602 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 612) no Hoare annotation was computed. [2018-12-03 03:47:17,603 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 623) no Hoare annotation was computed. [2018-12-03 03:47:17,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:47:17 BoogieIcfgContainer [2018-12-03 03:47:17,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:47:17,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:47:17,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:47:17,626 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:47:17,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:47:04" (3/4) ... [2018-12-03 03:47:17,630 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:47:17,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:47:17,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:47:17,635 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_accept [2018-12-03 03:47:17,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-03 03:47:17,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 03:47:17,642 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 03:47:17,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) [2018-12-03 03:47:17,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 8464) || ((((!(8673 == s__state) && 8672 <= s__state) && !(8672 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) [2018-12-03 03:47:17,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 8464) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0))) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-03 03:47:17,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || (((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8672 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || ((((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576)) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(8545 == s__state)) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (((((s__state <= 8576 && (((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 3 && !(s__hit == 0)) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 8464) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) [2018-12-03 03:47:17,662 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(8672 == s__state) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(8672 == s__state) || !(\old(initial_state) == 8464) [2018-12-03 03:47:17,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 8464) [2018-12-03 03:47:17,694 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32cba49c-fd2b-4dcd-8008-6698a213d098/bin-2019/utaipan/witness.graphml [2018-12-03 03:47:17,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:47:17,694 INFO L168 Benchmark]: Toolchain (without parser) took 14029.72 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 922.7 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -252.0 MB). Peak memory consumption was 670.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: Boogie Preprocessor took 24.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: RCFGBuilder took 342.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-03 03:47:17,695 INFO L168 Benchmark]: TraceAbstraction took 13362.40 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 832.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 03:47:17,696 INFO L168 Benchmark]: Witness Printer took 67.59 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:47:17,696 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13362.40 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 832.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -166.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 67.59 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 666]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(8672 == s__state) || !(\old(initial_state) == 8464) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(8545 == s__state)) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (((((s__state <= 8576 && (((((!(8448 == s__state) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || (((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 8464) || ((((!(8673 == s__state) && 8672 <= s__state) && !(8672 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag <= 3) && !(12292 == s__state)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) || !(\old(initial_state) == 8464) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && !(s__hit == 0)) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 8464) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: ((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) || !(\old(initial_state) == 8464) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 3) && !(s__hit == 0)) && !(8496 == s__state)) && s__state <= 8672) && !(8497 == s__state)) || (s__state <= 8576 && (((((((((!(8560 == s__state) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8672 == s__state)) && !(8481 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && blastFlag <= 2) && !(8496 == s__state)) && !(8497 == s__state))) || !(\old(initial_state) == 8464) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 8464) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 8464) || ((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8673 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0))) || ((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8672 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || ((((((((!(8560 == s__state) && !(8545 == s__state)) && blastFlag <= 2) && !(8544 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8576)) || !(\old(initial_state) == 8464) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__hit == 0)) || !(\old(initial_state) == 8464)) || ((s__s3__tmp__next_state___0 <= 3 && blastFlag <= 3) && s__state == 8448)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || s__state <= 3) || ((((((((blastFlag <= 2 && !(8545 == s__state)) && !(8497 == s__state)) && !(8657 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672)) || ((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((!(8560 == s__state) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && !(s__hit == 0)) && s__state <= 8672) || !(\old(initial_state) == 8464)) || (((((((((((((!(8560 == s__state) && blastFlag <= 2) && !(8545 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(8657 == s__state)) && !(8656 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8480 == s__state)) && !(8481 == s__state)) && s__state <= 8672) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 148 locations, 1 error locations. SAFE Result, 13.3s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 5267 SDtfs, 6674 SDslu, 4554 SDs, 0 SdLazy, 4133 SolverSat, 909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4211 GetRequests, 4125 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2224occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.5601190476190477 AbsIntWeakeningRatio, 0.5634920634920635 AbsIntAvgWeakeningVarsNumRemoved, 2.5238095238095237 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 976 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 2047 HoareAnnotationTreeSize, 33 FomulaSimplifications, 26618 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 33 FomulaSimplificationsInter, 11157 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 8510 NumberOfCodeBlocks, 8510 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 9323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4158813 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3482 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 32808/32964 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...