./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:21:29,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:21:29,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:21:29,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:21:29,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:21:29,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:21:29,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:21:29,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:21:29,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:21:29,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:21:29,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:21:29,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:21:29,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:21:29,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:21:29,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:21:29,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:21:29,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:21:29,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:21:29,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:21:29,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:21:29,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:21:29,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:21:29,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:21:29,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:21:29,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:21:29,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:21:29,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:21:29,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:21:29,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:21:29,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:21:29,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:21:29,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:21:29,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:21:29,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:21:29,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:21:29,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:21:29,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:21:29,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:21:29,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:21:29,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:21:29,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:21:29,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:21:29,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:21:29,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:21:29,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:21:29,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:21:29,862 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:21:29,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:21:29,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:21:29,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:21:29,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:21:29,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:21:29,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:21:29,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:21:29,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:21:29,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:21:29,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:21:29,866 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:21:29,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:21:29,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:21:29,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:21:29,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:21:29,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:21:29,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:21:29,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:21:29,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:21:29,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:21:29,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:21:29,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:21:29,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:21:29,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer 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 -> Automizer 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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-11-20 05:21:30,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:21:30,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:21:30,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:21:30,059 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:21:30,060 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:21:30,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 05:21:30,122 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/data/7dfe7b3d9/35e60ab4728541f0b9bb69bfb005b5a3/FLAGbbb9dbe9f [2019-11-20 05:21:30,636 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:21:30,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 05:21:30,661 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/data/7dfe7b3d9/35e60ab4728541f0b9bb69bfb005b5a3/FLAGbbb9dbe9f [2019-11-20 05:21:30,994 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/data/7dfe7b3d9/35e60ab4728541f0b9bb69bfb005b5a3 [2019-11-20 05:21:30,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:21:30,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:21:30,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:21:31,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:21:31,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:21:31,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:21:30" (1/1) ... [2019-11-20 05:21:31,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329e6471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31, skipping insertion in model container [2019-11-20 05:21:31,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:21:30" (1/1) ... [2019-11-20 05:21:31,014 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:21:31,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:21:31,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:21:31,388 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:21:31,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:21:31,465 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:21:31,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31 WrapperNode [2019-11-20 05:21:31,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:21:31,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:21:31,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:21:31,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:21:31,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:21:31,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:21:31,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:21:31,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:21:31,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... [2019-11-20 05:21:31,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:21:31,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:21:31,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:21:31,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:21:31,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:21:31,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:21:31,793 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 05:21:32,445 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-20 05:21:32,446 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-20 05:21:32,447 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:21:32,448 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 05:21:32,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:21:32 BoogieIcfgContainer [2019-11-20 05:21:32,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:21:32,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:21:32,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:21:32,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:21:32,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:21:30" (1/3) ... [2019-11-20 05:21:32,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c9e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:21:32, skipping insertion in model container [2019-11-20 05:21:32,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:21:31" (2/3) ... [2019-11-20 05:21:32,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c9e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:21:32, skipping insertion in model container [2019-11-20 05:21:32,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:21:32" (3/3) ... [2019-11-20 05:21:32,456 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-11-20 05:21:32,466 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:21:32,473 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:21:32,484 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:21:32,527 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:21:32,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:21:32,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:21:32,528 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:21:32,528 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:21:32,528 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:21:32,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:21:32,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:21:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-20 05:21:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 05:21:32,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:32,571 INFO L410 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] [2019-11-20 05:21:32,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:32,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-20 05:21:32,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:32,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799022284] [2019-11-20 05:21:32,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:32,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799022284] [2019-11-20 05:21:32,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:32,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:32,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522911917] [2019-11-20 05:21:32,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:32,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:32,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:32,823 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-20 05:21:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:33,160 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-20 05:21:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:33,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-20 05:21:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:33,174 INFO L225 Difference]: With dead ends: 322 [2019-11-20 05:21:33,174 INFO L226 Difference]: Without dead ends: 170 [2019-11-20 05:21:33,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-20 05:21:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-20 05:21:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-20 05:21:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-20 05:21:33,233 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-20 05:21:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:33,233 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-20 05:21:33,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-20 05:21:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:21:33,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:33,237 INFO L410 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] [2019-11-20 05:21:33,237 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-20 05:21:33,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:33,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847046420] [2019-11-20 05:21:33,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:33,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847046420] [2019-11-20 05:21:33,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:33,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:33,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710943495] [2019-11-20 05:21:33,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:33,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:33,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:33,355 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-20 05:21:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:33,619 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-20 05:21:33,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:33,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 05:21:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:33,624 INFO L225 Difference]: With dead ends: 371 [2019-11-20 05:21:33,624 INFO L226 Difference]: Without dead ends: 211 [2019-11-20 05:21:33,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-20 05:21:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-20 05:21:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 05:21:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-20 05:21:33,652 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-20 05:21:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:33,653 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-20 05:21:33,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-20 05:21:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 05:21:33,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:33,658 INFO L410 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] [2019-11-20 05:21:33,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-20 05:21:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699110047] [2019-11-20 05:21:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:33,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699110047] [2019-11-20 05:21:33,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:33,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:33,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226908047] [2019-11-20 05:21:33,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:33,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:33,745 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-20 05:21:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:33,983 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-20 05:21:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:33,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-20 05:21:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:33,989 INFO L225 Difference]: With dead ends: 436 [2019-11-20 05:21:33,992 INFO L226 Difference]: Without dead ends: 237 [2019-11-20 05:21:33,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-20 05:21:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-20 05:21:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 05:21:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-20 05:21:34,037 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-20 05:21:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:34,037 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-20 05:21:34,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-20 05:21:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 05:21:34,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:34,042 INFO L410 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] [2019-11-20 05:21:34,042 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-20 05:21:34,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:34,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219435803] [2019-11-20 05:21:34,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:34,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219435803] [2019-11-20 05:21:34,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:34,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:34,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329238553] [2019-11-20 05:21:34,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:34,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,108 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-20 05:21:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:34,275 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-20 05:21:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:34,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 05:21:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:34,277 INFO L225 Difference]: With dead ends: 484 [2019-11-20 05:21:34,278 INFO L226 Difference]: Without dead ends: 254 [2019-11-20 05:21:34,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-20 05:21:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-20 05:21:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-20 05:21:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-20 05:21:34,298 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-20 05:21:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:34,298 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-20 05:21:34,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-20 05:21:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 05:21:34,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:34,302 INFO L410 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] [2019-11-20 05:21:34,303 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-20 05:21:34,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:34,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481715601] [2019-11-20 05:21:34,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:34,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481715601] [2019-11-20 05:21:34,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:34,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:34,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821669761] [2019-11-20 05:21:34,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:34,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,385 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-20 05:21:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:34,581 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-20 05:21:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:34,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-20 05:21:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:34,584 INFO L225 Difference]: With dead ends: 543 [2019-11-20 05:21:34,584 INFO L226 Difference]: Without dead ends: 298 [2019-11-20 05:21:34,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-20 05:21:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-20 05:21:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 05:21:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-20 05:21:34,597 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-20 05:21:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:34,597 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-20 05:21:34,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-20 05:21:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:21:34,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:34,601 INFO L410 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] [2019-11-20 05:21:34,602 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-20 05:21:34,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:34,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313598556] [2019-11-20 05:21:34,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:34,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313598556] [2019-11-20 05:21:34,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:34,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:34,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648942875] [2019-11-20 05:21:34,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:34,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,655 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-20 05:21:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:34,815 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-20 05:21:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:34,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 05:21:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:34,818 INFO L225 Difference]: With dead ends: 583 [2019-11-20 05:21:34,818 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 05:21:34,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 05:21:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-20 05:21:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-20 05:21:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-20 05:21:34,829 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-20 05:21:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:34,830 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-20 05:21:34,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-20 05:21:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 05:21:34,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:34,832 INFO L410 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] [2019-11-20 05:21:34,832 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-20 05:21:34,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:34,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677927182] [2019-11-20 05:21:34,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:21:34,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677927182] [2019-11-20 05:21:34,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:34,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:34,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452620139] [2019-11-20 05:21:34,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:34,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:34,880 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-20 05:21:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:35,071 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-20 05:21:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:35,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-20 05:21:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:35,075 INFO L225 Difference]: With dead ends: 585 [2019-11-20 05:21:35,075 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 05:21:35,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 05:21:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-20 05:21:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-20 05:21:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-20 05:21:35,088 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-20 05:21:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:35,089 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-20 05:21:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-20 05:21:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 05:21:35,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:35,091 INFO L410 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] [2019-11-20 05:21:35,091 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-20 05:21:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:35,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019305670] [2019-11-20 05:21:35,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 05:21:35,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019305670] [2019-11-20 05:21:35,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:35,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:35,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977572101] [2019-11-20 05:21:35,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:35,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,133 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-20 05:21:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:35,265 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-20 05:21:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:35,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 05:21:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:35,268 INFO L225 Difference]: With dead ends: 585 [2019-11-20 05:21:35,269 INFO L226 Difference]: Without dead ends: 300 [2019-11-20 05:21:35,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-20 05:21:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-20 05:21:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-20 05:21:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-20 05:21:35,282 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-20 05:21:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:35,282 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-20 05:21:35,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-20 05:21:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 05:21:35,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:35,285 INFO L410 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] [2019-11-20 05:21:35,285 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:35,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-20 05:21:35,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:35,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006367111] [2019-11-20 05:21:35,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006367111] [2019-11-20 05:21:35,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:35,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119784043] [2019-11-20 05:21:35,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:35,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,340 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-20 05:21:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:35,515 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-20 05:21:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:35,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 05:21:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:35,518 INFO L225 Difference]: With dead ends: 624 [2019-11-20 05:21:35,518 INFO L226 Difference]: Without dead ends: 331 [2019-11-20 05:21:35,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-20 05:21:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-20 05:21:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-20 05:21:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-20 05:21:35,533 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-20 05:21:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:35,534 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-20 05:21:35,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-20 05:21:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 05:21:35,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:35,536 INFO L410 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] [2019-11-20 05:21:35,536 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:35,537 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-20 05:21:35,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:35,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991027629] [2019-11-20 05:21:35,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:35,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991027629] [2019-11-20 05:21:35,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:35,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:35,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357343406] [2019-11-20 05:21:35,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:35,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:35,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,581 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-20 05:21:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:35,768 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-20 05:21:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:35,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 05:21:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:35,772 INFO L225 Difference]: With dead ends: 685 [2019-11-20 05:21:35,772 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 05:21:35,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 05:21:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-20 05:21:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 05:21:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-20 05:21:35,787 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-20 05:21:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:35,788 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-20 05:21:35,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-20 05:21:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 05:21:35,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:35,790 INFO L410 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] [2019-11-20 05:21:35,790 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-20 05:21:35,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:35,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912035838] [2019-11-20 05:21:35,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:35,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912035838] [2019-11-20 05:21:35,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:35,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:35,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403525363] [2019-11-20 05:21:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:35,845 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-20 05:21:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:36,007 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-20 05:21:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:36,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 05:21:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:36,010 INFO L225 Difference]: With dead ends: 707 [2019-11-20 05:21:36,010 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 05:21:36,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 05:21:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-20 05:21:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 05:21:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-20 05:21:36,025 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-20 05:21:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:36,025 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-20 05:21:36,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-20 05:21:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 05:21:36,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:36,027 INFO L410 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] [2019-11-20 05:21:36,027 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-20 05:21:36,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:36,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067285011] [2019-11-20 05:21:36,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 05:21:36,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067285011] [2019-11-20 05:21:36,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:36,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:36,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971697228] [2019-11-20 05:21:36,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:36,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,073 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-20 05:21:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:36,256 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-20 05:21:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:36,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 05:21:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:36,259 INFO L225 Difference]: With dead ends: 712 [2019-11-20 05:21:36,260 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 05:21:36,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 05:21:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-20 05:21:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 05:21:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-20 05:21:36,278 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-20 05:21:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:36,279 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-20 05:21:36,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-20 05:21:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 05:21:36,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:36,281 INFO L410 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] [2019-11-20 05:21:36,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-20 05:21:36,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:36,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171606319] [2019-11-20 05:21:36,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 05:21:36,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171606319] [2019-11-20 05:21:36,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:36,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393574180] [2019-11-20 05:21:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:36,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,327 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-20 05:21:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:36,482 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-20 05:21:36,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:36,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 05:21:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:36,485 INFO L225 Difference]: With dead ends: 730 [2019-11-20 05:21:36,486 INFO L226 Difference]: Without dead ends: 381 [2019-11-20 05:21:36,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-20 05:21:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-20 05:21:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-20 05:21:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-20 05:21:36,501 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-20 05:21:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-20 05:21:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-20 05:21:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 05:21:36,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:36,505 INFO L410 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] [2019-11-20 05:21:36,505 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-20 05:21:36,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:36,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875187263] [2019-11-20 05:21:36,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 05:21:36,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875187263] [2019-11-20 05:21:36,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:36,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:36,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422086742] [2019-11-20 05:21:36,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:36,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,552 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-20 05:21:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:36,713 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-20 05:21:36,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:36,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 05:21:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:36,717 INFO L225 Difference]: With dead ends: 751 [2019-11-20 05:21:36,717 INFO L226 Difference]: Without dead ends: 381 [2019-11-20 05:21:36,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-20 05:21:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-20 05:21:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-20 05:21:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-20 05:21:36,734 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-20 05:21:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:36,735 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-20 05:21:36,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-20 05:21:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 05:21:36,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:36,737 INFO L410 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] [2019-11-20 05:21:36,737 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:36,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-20 05:21:36,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:36,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310251357] [2019-11-20 05:21:36,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 05:21:36,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310251357] [2019-11-20 05:21:36,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:36,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:36,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834324300] [2019-11-20 05:21:36,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:36,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:36,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:36,796 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-20 05:21:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:36,847 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-20 05:21:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:36,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-20 05:21:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:36,853 INFO L225 Difference]: With dead ends: 747 [2019-11-20 05:21:36,853 INFO L226 Difference]: Without dead ends: 745 [2019-11-20 05:21:36,855 INFO L630 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 [2019-11-20 05:21:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-20 05:21:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-20 05:21:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-20 05:21:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-20 05:21:36,889 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-20 05:21:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:36,890 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-20 05:21:36,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-20 05:21:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 05:21:36,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:36,893 INFO L410 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] [2019-11-20 05:21:36,894 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:36,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-20 05:21:36,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:36,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169463572] [2019-11-20 05:21:36,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:36,905 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:36,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731177984] [2019-11-20 05:21:36,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:37,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:21:37,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 05:21:37,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169463572] [2019-11-20 05:21:37,083 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:37,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731177984] [2019-11-20 05:21:37,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:37,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:21:37,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288705048] [2019-11-20 05:21:37,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:37,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:37,085 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-20 05:21:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:37,145 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-20 05:21:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:37,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 05:21:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:37,153 INFO L225 Difference]: With dead ends: 1851 [2019-11-20 05:21:37,154 INFO L226 Difference]: Without dead ends: 1113 [2019-11-20 05:21:37,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-20 05:21:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-20 05:21:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-20 05:21:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-20 05:21:37,209 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-20 05:21:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:37,209 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-20 05:21:37,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-20 05:21:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 05:21:37,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:37,214 INFO L410 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] [2019-11-20 05:21:37,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:37,418 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-20 05:21:37,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:37,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434484216] [2019-11-20 05:21:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:37,428 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:37,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655102021] [2019-11-20 05:21:37,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:37,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:21:37,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 05:21:37,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434484216] [2019-11-20 05:21:37,576 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:37,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655102021] [2019-11-20 05:21:37,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:37,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:37,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222261383] [2019-11-20 05:21:37,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:37,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:37,582 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-20 05:21:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:37,659 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-20 05:21:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:37,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-20 05:21:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:37,668 INFO L225 Difference]: With dead ends: 2219 [2019-11-20 05:21:37,668 INFO L226 Difference]: Without dead ends: 1481 [2019-11-20 05:21:37,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-20 05:21:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-20 05:21:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-20 05:21:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-20 05:21:37,737 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-20 05:21:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:37,737 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-20 05:21:37,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-20 05:21:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 05:21:37,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:37,742 INFO L410 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] [2019-11-20 05:21:37,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:37,946 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-20 05:21:37,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:37,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588951748] [2019-11-20 05:21:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-20 05:21:38,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588951748] [2019-11-20 05:21:38,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:38,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:38,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673192948] [2019-11-20 05:21:38,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:38,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:38,013 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-20 05:21:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:38,206 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-20 05:21:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:38,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 05:21:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:38,215 INFO L225 Difference]: With dead ends: 3059 [2019-11-20 05:21:38,215 INFO L226 Difference]: Without dead ends: 1585 [2019-11-20 05:21:38,217 INFO L630 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 [2019-11-20 05:21:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-20 05:21:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-20 05:21:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-20 05:21:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-20 05:21:38,277 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-20 05:21:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:38,277 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-20 05:21:38,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-20 05:21:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 05:21:38,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:38,283 INFO L410 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] [2019-11-20 05:21:38,283 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-20 05:21:38,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:38,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927505502] [2019-11-20 05:21:38,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:38,295 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:38,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492545322] [2019-11-20 05:21:38,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:38,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:21:38,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 05:21:38,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927505502] [2019-11-20 05:21:38,444 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:38,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492545322] [2019-11-20 05:21:38,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:38,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:38,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728733158] [2019-11-20 05:21:38,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:38,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:38,449 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-20 05:21:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:38,545 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-20 05:21:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:38,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-20 05:21:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:38,558 INFO L225 Difference]: With dead ends: 3139 [2019-11-20 05:21:38,558 INFO L226 Difference]: Without dead ends: 1964 [2019-11-20 05:21:38,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-20 05:21:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-20 05:21:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-20 05:21:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-20 05:21:38,666 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-20 05:21:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:38,667 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-20 05:21:38,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-20 05:21:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 05:21:38,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:38,673 INFO L410 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] [2019-11-20 05:21:38,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:38,876 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-20 05:21:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:38,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393797355] [2019-11-20 05:21:38,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:38,895 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:38,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748512485] [2019-11-20 05:21:38,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:39,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:21:39,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 05:21:39,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393797355] [2019-11-20 05:21:39,073 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:39,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748512485] [2019-11-20 05:21:39,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:39,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:39,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201633227] [2019-11-20 05:21:39,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:39,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:39,075 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-20 05:21:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:39,197 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-20 05:21:39,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:39,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-20 05:21:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:39,219 INFO L225 Difference]: With dead ends: 5743 [2019-11-20 05:21:39,219 INFO L226 Difference]: Without dead ends: 3786 [2019-11-20 05:21:39,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-20 05:21:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-20 05:21:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 05:21:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-20 05:21:39,367 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-20 05:21:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:39,368 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-20 05:21:39,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-20 05:21:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 05:21:39,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:39,380 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:21:39,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:39,585 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:39,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-20 05:21:39,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071953689] [2019-11-20 05:21:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:39,600 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:39,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297000694] [2019-11-20 05:21:39,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:39,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:21:39,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 05:21:39,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071953689] [2019-11-20 05:21:39,779 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:39,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297000694] [2019-11-20 05:21:39,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:39,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:39,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106606402] [2019-11-20 05:21:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:39,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:39,782 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-20 05:21:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:40,111 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-20 05:21:40,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:40,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-20 05:21:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:40,138 INFO L225 Difference]: With dead ends: 7651 [2019-11-20 05:21:40,138 INFO L226 Difference]: Without dead ends: 3874 [2019-11-20 05:21:40,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-20 05:21:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-20 05:21:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 05:21:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-20 05:21:40,340 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-20 05:21:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:40,340 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-20 05:21:40,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-20 05:21:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-20 05:21:40,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:40,352 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:21:40,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:40,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-20 05:21:40,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:40,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190540827] [2019-11-20 05:21:40,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-20 05:21:40,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190540827] [2019-11-20 05:21:40,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:40,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:40,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883068074] [2019-11-20 05:21:40,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:40,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:40,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:40,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:40,651 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-20 05:21:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:40,952 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-20 05:21:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:40,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-20 05:21:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:40,977 INFO L225 Difference]: With dead ends: 7683 [2019-11-20 05:21:40,977 INFO L226 Difference]: Without dead ends: 3906 [2019-11-20 05:21:40,983 INFO L630 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 [2019-11-20 05:21:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-20 05:21:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-20 05:21:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 05:21:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-20 05:21:41,135 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-20 05:21:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:41,136 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-20 05:21:41,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-20 05:21:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-20 05:21:41,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:41,148 INFO L410 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] [2019-11-20 05:21:41,148 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-20 05:21:41,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:41,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477158831] [2019-11-20 05:21:41,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:41,165 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:41,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242512980] [2019-11-20 05:21:41,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:41,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:21:41,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-20 05:21:41,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477158831] [2019-11-20 05:21:41,343 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:41,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242512980] [2019-11-20 05:21:41,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:41,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:41,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784852582] [2019-11-20 05:21:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:41,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:41,345 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-20 05:21:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:41,609 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-20 05:21:41,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:41,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-20 05:21:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:41,636 INFO L225 Difference]: With dead ends: 7561 [2019-11-20 05:21:41,636 INFO L226 Difference]: Without dead ends: 3784 [2019-11-20 05:21:41,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-20 05:21:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-20 05:21:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-20 05:21:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-20 05:21:41,783 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-20 05:21:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:41,784 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-20 05:21:41,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-20 05:21:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 05:21:41,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:41,795 INFO L410 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] [2019-11-20 05:21:41,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:41,999 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:41,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-20 05:21:42,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:42,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440635617] [2019-11-20 05:21:42,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:42,016 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 05:21:42,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91215584] [2019-11-20 05:21:42,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:42,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:21:42,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-20 05:21:42,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440635617] [2019-11-20 05:21:42,199 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 05:21:42,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91215584] [2019-11-20 05:21:42,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:42,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:42,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41391267] [2019-11-20 05:21:42,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:42,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:42,201 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-20 05:21:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:42,440 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-20 05:21:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:42,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 05:21:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:42,446 INFO L225 Difference]: With dead ends: 7951 [2019-11-20 05:21:42,446 INFO L226 Difference]: Without dead ends: 2307 [2019-11-20 05:21:42,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-20 05:21:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-20 05:21:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-20 05:21:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-20 05:21:42,524 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-20 05:21:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-20 05:21:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-20 05:21:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-20 05:21:42,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:42,533 INFO L410 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] [2019-11-20 05:21:42,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:42,739 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-20 05:21:42,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:42,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584586835] [2019-11-20 05:21:42,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-20 05:21:42,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584586835] [2019-11-20 05:21:42,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:42,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:42,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470430829] [2019-11-20 05:21:42,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:42,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:42,885 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-20 05:21:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:43,144 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-20 05:21:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:43,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-20 05:21:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:43,149 INFO L225 Difference]: With dead ends: 4829 [2019-11-20 05:21:43,150 INFO L226 Difference]: Without dead ends: 2529 [2019-11-20 05:21:43,152 INFO L630 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 [2019-11-20 05:21:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-20 05:21:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-20 05:21:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-20 05:21:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-20 05:21:43,226 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-20 05:21:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:43,227 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-20 05:21:43,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-20 05:21:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-20 05:21:43,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:43,236 INFO L410 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] [2019-11-20 05:21:43,237 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-20 05:21:43,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:43,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914993534] [2019-11-20 05:21:43,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-20 05:21:43,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914993534] [2019-11-20 05:21:43,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:43,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:43,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766383635] [2019-11-20 05:21:43,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:43,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:43,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:43,365 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-20 05:21:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:43,555 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-20 05:21:43,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:43,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-20 05:21:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:43,561 INFO L225 Difference]: With dead ends: 4949 [2019-11-20 05:21:43,561 INFO L226 Difference]: Without dead ends: 2499 [2019-11-20 05:21:43,564 INFO L630 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 [2019-11-20 05:21:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-20 05:21:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-20 05:21:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-20 05:21:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-20 05:21:43,636 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-20 05:21:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:43,636 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-20 05:21:43,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-20 05:21:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-20 05:21:43,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:43,646 INFO L410 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] [2019-11-20 05:21:43,647 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-20 05:21:43,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:43,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818064790] [2019-11-20 05:21:43,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 05:21:43,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818064790] [2019-11-20 05:21:43,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012078580] [2019-11-20 05:21:43,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/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 [2019-11-20 05:21:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:43,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:21:43,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-20 05:21:44,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:21:44,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 05:21:44,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906434991] [2019-11-20 05:21:44,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:21:44,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:21:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:21:44,090 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-20 05:21:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:44,553 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-11-20 05:21:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:21:44,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-20 05:21:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:44,562 INFO L225 Difference]: With dead ends: 7213 [2019-11-20 05:21:44,562 INFO L226 Difference]: Without dead ends: 4617 [2019-11-20 05:21:44,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:21:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-11-20 05:21:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-11-20 05:21:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-20 05:21:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-20 05:21:44,660 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-20 05:21:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:44,661 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-20 05:21:44,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:21:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-20 05:21:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-20 05:21:44,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:44,674 INFO L410 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] [2019-11-20 05:21:44,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:44,881 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-20 05:21:44,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:44,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762112362] [2019-11-20 05:21:44,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-20 05:21:45,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762112362] [2019-11-20 05:21:45,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:45,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:45,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384807259] [2019-11-20 05:21:45,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:45,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:45,069 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-20 05:21:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:45,266 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-20 05:21:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:45,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-20 05:21:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:45,272 INFO L225 Difference]: With dead ends: 5073 [2019-11-20 05:21:45,272 INFO L226 Difference]: Without dead ends: 2546 [2019-11-20 05:21:45,276 INFO L630 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 [2019-11-20 05:21:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-20 05:21:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-20 05:21:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-20 05:21:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-20 05:21:45,369 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-20 05:21:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:45,370 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-20 05:21:45,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-20 05:21:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-20 05:21:45,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:45,387 INFO L410 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] [2019-11-20 05:21:45,387 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-20 05:21:45,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:45,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300619328] [2019-11-20 05:21:45,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-20 05:21:45,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300619328] [2019-11-20 05:21:45,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:45,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:45,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590815133] [2019-11-20 05:21:45,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:45,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:45,671 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-20 05:21:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:45,883 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-20 05:21:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:45,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-20 05:21:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:45,889 INFO L225 Difference]: With dead ends: 5277 [2019-11-20 05:21:45,889 INFO L226 Difference]: Without dead ends: 2750 [2019-11-20 05:21:45,895 INFO L630 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 [2019-11-20 05:21:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-20 05:21:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-20 05:21:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-20 05:21:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-20 05:21:45,983 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-20 05:21:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:45,984 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-20 05:21:45,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-20 05:21:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-20 05:21:46,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:46,004 INFO L410 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] [2019-11-20 05:21:46,004 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:46,004 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-20 05:21:46,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:46,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868927683] [2019-11-20 05:21:46,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-20 05:21:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868927683] [2019-11-20 05:21:46,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:21:46,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:21:46,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569697395] [2019-11-20 05:21:46,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:21:46,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:21:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:21:46,313 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-20 05:21:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:46,533 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-20 05:21:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:21:46,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-20 05:21:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:46,539 INFO L225 Difference]: With dead ends: 5697 [2019-11-20 05:21:46,539 INFO L226 Difference]: Without dead ends: 2966 [2019-11-20 05:21:46,544 INFO L630 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 [2019-11-20 05:21:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-20 05:21:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-20 05:21:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-20 05:21:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-20 05:21:46,623 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-20 05:21:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:46,624 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-20 05:21:46,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:21:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-20 05:21:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-20 05:21:46,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:21:46,633 INFO L410 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] [2019-11-20 05:21:46,633 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:21:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:21:46,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-20 05:21:46,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:21:46,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981455095] [2019-11-20 05:21:46,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:21:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 05:21:46,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981455095] [2019-11-20 05:21:46,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831787391] [2019-11-20 05:21:46,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:21:47,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:21:47,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:21:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-20 05:21:47,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:21:47,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 05:21:47,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691242236] [2019-11-20 05:21:47,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:21:47,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:21:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:21:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:21:47,474 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-20 05:21:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:21:47,724 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-20 05:21:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:21:47,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-20 05:21:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:21:47,726 INFO L225 Difference]: With dead ends: 4704 [2019-11-20 05:21:47,726 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:21:47,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:21:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:21:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:21:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:21:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:21:47,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-20 05:21:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:21:47,733 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:21:47,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:21:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:21:47,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:21:47,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:21:47,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:21:48,270 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-20 05:21:48,830 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-20 05:21:49,137 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 05:21:49,293 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-20 05:21:49,575 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 05:21:49,878 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-20 05:21:50,088 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 05:21:50,318 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-20 05:21:50,530 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-20 05:21:50,749 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-20 05:21:51,018 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-20 05:21:51,280 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 05:21:51,517 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 05:21:51,723 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 05:21:52,039 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 05:21:52,223 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-20 05:21:52,533 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-20 05:21:52,739 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-20 05:21:53,082 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-20 05:21:53,256 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-20 05:21:53,436 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-11-20 05:21:53,439 INFO L444 ceAbstractionStarter]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-20 05:21:53,440 INFO L440 ceAbstractionStarter]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-20 05:21:53,440 INFO L440 ceAbstractionStarter]: At program point L103(lines 102 625) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-20 05:21:53,440 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-11-20 05:21:53,440 INFO L444 ceAbstractionStarter]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,440 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-20 05:21:53,441 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-11-20 05:21:53,441 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-11-20 05:21:53,441 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-11-20 05:21:53,441 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-11-20 05:21:53,441 INFO L440 ceAbstractionStarter]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 05:21:53,441 INFO L440 ceAbstractionStarter]: At program point L172(lines 168 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,442 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-20 05:21:53,442 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 05:21:53,442 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-20 05:21:53,444 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-11-20 05:21:53,445 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-11-20 05:21:53,446 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-20 05:21:53,446 INFO L440 ceAbstractionStarter]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-20 05:21:53,446 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 05:21:53,446 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 05:21:53,447 INFO L440 ceAbstractionStarter]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 05:21:53,447 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-20 05:21:53,447 INFO L444 ceAbstractionStarter]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,447 INFO L447 ceAbstractionStarter]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-11-20 05:21:53,447 INFO L444 ceAbstractionStarter]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-11-20 05:21:53,447 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-11-20 05:21:53,448 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-11-20 05:21:53,448 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-11-20 05:21:53,448 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-11-20 05:21:53,448 INFO L447 ceAbstractionStarter]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-11-20 05:21:53,448 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-11-20 05:21:53,448 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-20 05:21:53,449 INFO L440 ceAbstractionStarter]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,449 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 612) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,449 INFO L444 ceAbstractionStarter]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L440 ceAbstractionStarter]: At program point L212(lines 105 624) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-20 05:21:53,450 INFO L444 ceAbstractionStarter]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-11-20 05:21:53,451 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 05:21:53,451 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-11-20 05:21:53,451 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-11-20 05:21:53,451 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-11-20 05:21:53,451 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L444 ceAbstractionStarter]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-20 05:21:53,452 INFO L440 ceAbstractionStarter]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,453 INFO L440 ceAbstractionStarter]: At program point L151(lines 147 610) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,453 INFO L444 ceAbstractionStarter]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,453 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:21:53,453 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-11-20 05:21:53,453 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-11-20 05:21:53,454 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-11-20 05:21:53,454 INFO L444 ceAbstractionStarter]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-11-20 05:21:53,454 INFO L444 ceAbstractionStarter]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-20 05:21:53,454 INFO L444 ceAbstractionStarter]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-20 05:21:53,454 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 05:21:53,454 INFO L440 ceAbstractionStarter]: At program point L551(lines 64 674) the Hoare annotation is: false [2019-11-20 05:21:53,455 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-20 05:21:53,455 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L447 ceAbstractionStarter]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-20 05:21:53,456 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-20 05:21:53,457 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:21:53,457 INFO L444 ceAbstractionStarter]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,457 INFO L440 ceAbstractionStarter]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .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 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,457 INFO L440 ceAbstractionStarter]: At program point L157(lines 153 608) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 05:21:53,458 INFO L440 ceAbstractionStarter]: At program point L124(lines 123 618) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-20 05:21:53,458 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-11-20 05:21:53,458 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-20 05:21:53,458 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-20 05:21:53,458 INFO L440 ceAbstractionStarter]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-20 05:21:53,459 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-20 05:21:53,460 INFO L444 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-20 05:21:53,460 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-20 05:21:53,460 INFO L444 ceAbstractionStarter]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-20 05:21:53,460 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:21:53,461 INFO L447 ceAbstractionStarter]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-11-20 05:21:53,461 INFO L444 ceAbstractionStarter]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-11-20 05:21:53,462 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-11-20 05:21:53,462 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-11-20 05:21:53,462 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-20 05:21:53,462 INFO L440 ceAbstractionStarter]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-20 05:21:53,462 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 668) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-11-20 05:21:53,463 INFO L444 ceAbstractionStarter]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-11-20 05:21:53,464 INFO L444 ceAbstractionStarter]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-11-20 05:21:53,464 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-20 05:21:53,464 INFO L444 ceAbstractionStarter]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-11-20 05:21:53,464 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-20 05:21:53,464 INFO L440 ceAbstractionStarter]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,464 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-20 05:21:53,465 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-11-20 05:21:53,465 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-11-20 05:21:53,465 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-11-20 05:21:53,465 INFO L440 ceAbstractionStarter]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (and .cse3 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse3 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-20 05:21:53,465 INFO L444 ceAbstractionStarter]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-11-20 05:21:53,465 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-11-20 05:21:53,466 INFO L444 ceAbstractionStarter]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-11-20 05:21:53,466 INFO L444 ceAbstractionStarter]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-11-20 05:21:53,466 INFO L440 ceAbstractionStarter]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-20 05:21:53,466 INFO L440 ceAbstractionStarter]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,466 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-20 05:21:53,467 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 05:21:53,467 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-20 05:21:53,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:21:53 BoogieIcfgContainer [2019-11-20 05:21:53,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:21:53,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:21:53,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:21:53,528 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:21:53,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:21:32" (3/4) ... [2019-11-20 05:21:53,532 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:21:53,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:21:53,563 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:21:53,740 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25a8b8a9-0907-4565-a922-5438ed51e653/bin/uautomizer/witness.graphml [2019-11-20 05:21:53,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:21:53,742 INFO L168 Benchmark]: Toolchain (without parser) took 22744.37 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 963.6 MB). Free memory was 947.4 MB in the beginning and 1.6 GB in the end (delta: -648.0 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,742 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:21:53,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:21:53,744 INFO L168 Benchmark]: Boogie Preprocessor took 60.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,744 INFO L168 Benchmark]: RCFGBuilder took 839.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,744 INFO L168 Benchmark]: TraceAbstraction took 21077.62 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 814.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -524.9 MB). Peak memory consumption was 794.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,745 INFO L168 Benchmark]: Witness Printer took 213.52 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:53,747 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 839.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21077.62 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 814.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -524.9 MB). Peak memory consumption was 794.6 MB. Max. memory is 11.5 GB. * Witness Printer took 213.52 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 668]: 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: 126]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) || ((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8497)) && !(s__state == 8496)) && (((((((!(s__state == 8544) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8480)) && !(s__state == 12292)) && !(s__state == 8545)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 20.9s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1911 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40537 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6399 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3926 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...