./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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 28eb30d9833654ceca3228385af91acd247ea794 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:08:02,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:08:02,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:08:02,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:08:02,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:08:02,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:08:02,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:08:02,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:08:02,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:08:02,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:08:02,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:08:02,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:08:02,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:08:02,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:08:02,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:08:02,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:08:02,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:08:02,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:08:02,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:08:02,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:08:02,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:08:02,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:08:02,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:08:02,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:08:02,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:08:02,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:08:02,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:08:02,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:08:02,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:08:02,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:08:02,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:08:02,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:08:02,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:08:02,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:08:02,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:08:02,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:08:02,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:08:02,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:08:02,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:08:02,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:08:02,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:08:02,891 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:08:02,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:08:02,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:08:02,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:08:02,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:08:02,905 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:08:02,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:08:02,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:08:02,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:08:02,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:08:02,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:08:02,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:08:02,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:08:02,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:08:02,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:08:02,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:08:02,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:08:02,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:08:02,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:08:02,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:08:02,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:08:02,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:08:02,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:08:02,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:08:02,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:08:02,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:08:02,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:08:02,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:08:02,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:08:02,910 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_53a219a3-63fa-408f-b2f1-4eb0046f8967/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 -> 28eb30d9833654ceca3228385af91acd247ea794 [2019-11-15 22:08:02,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:08:02,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:08:02,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:08:02,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:08:02,952 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:08:02,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-15 22:08:03,015 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/data/b557c4ef1/7b12ef66bb8046859a776f5a7f361b8c/FLAG741d9fcf6 [2019-11-15 22:08:03,422 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:08:03,423 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-1.c [2019-11-15 22:08:03,439 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/data/b557c4ef1/7b12ef66bb8046859a776f5a7f361b8c/FLAG741d9fcf6 [2019-11-15 22:08:03,729 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/data/b557c4ef1/7b12ef66bb8046859a776f5a7f361b8c [2019-11-15 22:08:03,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:08:03,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:08:03,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:03,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:08:03,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:08:03,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:03" (1/1) ... [2019-11-15 22:08:03,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543dddea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:03, skipping insertion in model container [2019-11-15 22:08:03,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:03" (1/1) ... [2019-11-15 22:08:03,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:08:03,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:08:04,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:04,081 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:08:04,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:04,157 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:08:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04 WrapperNode [2019-11-15 22:08:04,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:04,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:04,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:08:04,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:08:04,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:04,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:08:04,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:08:04,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:08:04,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... [2019-11-15 22:08:04,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:08:04,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:08:04,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:08:04,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:08:04,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:08:04,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:08:04,578 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:08:05,183 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-15 22:08:05,183 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-15 22:08:05,184 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:08:05,184 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:08:05,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:05 BoogieIcfgContainer [2019-11-15 22:08:05,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:08:05,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:08:05,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:08:05,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:08:05,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:08:03" (1/3) ... [2019-11-15 22:08:05,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54475c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:08:05, skipping insertion in model container [2019-11-15 22:08:05,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:04" (2/3) ... [2019-11-15 22:08:05,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54475c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:08:05, skipping insertion in model container [2019-11-15 22:08:05,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:05" (3/3) ... [2019-11-15 22:08:05,201 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-11-15 22:08:05,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:08:05,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:08:05,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:08:05,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:08:05,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:08:05,270 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:08:05,271 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:08:05,271 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:08:05,271 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:08:05,271 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:08:05,271 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:08:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-15 22:08:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:08:05,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:05,298 INFO L380 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-15 22:08:05,300 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-15 22:08:05,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:05,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073385448] [2019-11-15 22:08:05,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:05,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:05,525 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-15 22:08:05,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073385448] [2019-11-15 22:08:05,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:05,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:05,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274713095] [2019-11-15 22:08:05,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:05,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:05,546 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-15 22:08:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:05,874 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-15 22:08:05,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:05,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-15 22:08:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:05,894 INFO L225 Difference]: With dead ends: 327 [2019-11-15 22:08:05,894 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 22:08:05,899 INFO L600 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-15 22:08:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 22:08:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-15 22:08:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-15 22:08:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-15 22:08:05,982 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-15 22:08:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:05,982 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-15 22:08:05,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-15 22:08:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:08:05,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:05,985 INFO L380 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-15 22:08:05,985 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:05,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-15 22:08:05,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:05,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409657608] [2019-11-15 22:08:05,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:05,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:05,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,095 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-15 22:08:06,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409657608] [2019-11-15 22:08:06,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:06,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:06,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094191532] [2019-11-15 22:08:06,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:06,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:06,099 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-15 22:08:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:06,339 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-15 22:08:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:06,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 22:08:06,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:06,344 INFO L225 Difference]: With dead ends: 379 [2019-11-15 22:08:06,344 INFO L226 Difference]: Without dead ends: 215 [2019-11-15 22:08:06,346 INFO L600 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-15 22:08:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-15 22:08:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-15 22:08:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 22:08:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-15 22:08:06,375 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-15 22:08:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:06,376 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-15 22:08:06,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-15 22:08:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 22:08:06,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:06,385 INFO L380 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-15 22:08:06,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-11-15 22:08:06,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:06,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958717051] [2019-11-15 22:08:06,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,491 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-15 22:08:06,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958717051] [2019-11-15 22:08:06,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:06,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:06,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697864813] [2019-11-15 22:08:06,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:06,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:06,499 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-15 22:08:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:06,711 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-15 22:08:06,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:06,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-15 22:08:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:06,713 INFO L225 Difference]: With dead ends: 444 [2019-11-15 22:08:06,714 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 22:08:06,715 INFO L600 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-15 22:08:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 22:08:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-15 22:08:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 22:08:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-15 22:08:06,735 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-15 22:08:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:06,736 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-15 22:08:06,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-15 22:08:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:08:06,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:06,738 INFO L380 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-15 22:08:06,738 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-11-15 22:08:06,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:06,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732793525] [2019-11-15 22:08:06,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:06,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:06,822 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-15 22:08:06,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732793525] [2019-11-15 22:08:06,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:06,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:06,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431164635] [2019-11-15 22:08:06,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:06,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:06,825 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-15 22:08:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:06,993 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-15 22:08:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:06,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:08:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:06,996 INFO L225 Difference]: With dead ends: 492 [2019-11-15 22:08:06,996 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 22:08:06,997 INFO L600 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-15 22:08:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 22:08:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-15 22:08:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-15 22:08:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-15 22:08:07,024 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-15 22:08:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,025 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-15 22:08:07,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-15 22:08:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:08:07,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,029 INFO L380 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-15 22:08:07,029 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:07,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-11-15 22:08:07,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499614147] [2019-11-15 22:08:07,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,109 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-15 22:08:07,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499614147] [2019-11-15 22:08:07,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:07,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:07,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640759476] [2019-11-15 22:08:07,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:07,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:07,112 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-15 22:08:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:07,335 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-15 22:08:07,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:07,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-15 22:08:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:07,346 INFO L225 Difference]: With dead ends: 551 [2019-11-15 22:08:07,346 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:08:07,347 INFO L600 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-15 22:08:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:08:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-15 22:08:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 22:08:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-15 22:08:07,359 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-15 22:08:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,359 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-15 22:08:07,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-15 22:08:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:08:07,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,361 INFO L380 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-15 22:08:07,367 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-11-15 22:08:07,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244526020] [2019-11-15 22:08:07,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,442 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-15 22:08:07,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244526020] [2019-11-15 22:08:07,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:07,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:07,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858314335] [2019-11-15 22:08:07,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:07,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:07,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:07,446 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-15 22:08:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:07,614 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-15 22:08:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:07,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:08:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:07,617 INFO L225 Difference]: With dead ends: 591 [2019-11-15 22:08:07,617 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:08:07,618 INFO L600 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-15 22:08:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:08:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-15 22:08:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-15 22:08:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-15 22:08:07,630 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-15 22:08:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,630 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-15 22:08:07,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-15 22:08:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:08:07,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,632 INFO L380 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-15 22:08:07,632 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-11-15 22:08:07,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804314866] [2019-11-15 22:08:07,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,676 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-15 22:08:07,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804314866] [2019-11-15 22:08:07,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:07,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:07,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959987690] [2019-11-15 22:08:07,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:07,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:07,678 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-15 22:08:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:07,859 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-15 22:08:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:07,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-15 22:08:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:07,862 INFO L225 Difference]: With dead ends: 593 [2019-11-15 22:08:07,862 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:08:07,862 INFO L600 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-15 22:08:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:08:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-15 22:08:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-15 22:08:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-15 22:08:07,874 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-15 22:08:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:07,874 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-15 22:08:07,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-15 22:08:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:08:07,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:07,876 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:07,876 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-11-15 22:08:07,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:07,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987340775] [2019-11-15 22:08:07,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:07,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:07,930 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-15 22:08:07,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987340775] [2019-11-15 22:08:07,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:07,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:07,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168755597] [2019-11-15 22:08:07,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:07,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:07,932 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-15 22:08:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,036 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-15 22:08:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:08,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:08:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,039 INFO L225 Difference]: With dead ends: 594 [2019-11-15 22:08:08,039 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 22:08:08,040 INFO L600 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-15 22:08:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 22:08:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-15 22:08:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-15 22:08:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-15 22:08:08,053 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-15 22:08:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,053 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-15 22:08:08,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-15 22:08:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:08:08,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,055 INFO L380 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-15 22:08:08,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-11-15 22:08:08,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942990097] [2019-11-15 22:08:08,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,106 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-15 22:08:08,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942990097] [2019-11-15 22:08:08,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:08,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:08,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36456878] [2019-11-15 22:08:08,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:08,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:08,109 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-15 22:08:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,252 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-15 22:08:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:08,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-15 22:08:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,256 INFO L225 Difference]: With dead ends: 634 [2019-11-15 22:08:08,256 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 22:08:08,257 INFO L600 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-15 22:08:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 22:08:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 22:08:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 22:08:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-15 22:08:08,269 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-15 22:08:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,270 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-15 22:08:08,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-15 22:08:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:08:08,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,271 INFO L380 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-15 22:08:08,271 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-11-15 22:08:08,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582210984] [2019-11-15 22:08:08,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,307 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-15 22:08:08,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582210984] [2019-11-15 22:08:08,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:08,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:08,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297080744] [2019-11-15 22:08:08,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:08,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:08,309 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-15 22:08:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,471 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-15 22:08:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:08,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:08:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,474 INFO L225 Difference]: With dead ends: 663 [2019-11-15 22:08:08,475 INFO L226 Difference]: Without dead ends: 336 [2019-11-15 22:08:08,475 INFO L600 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-15 22:08:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-15 22:08:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-15 22:08:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 22:08:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-15 22:08:08,489 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-15 22:08:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,490 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-15 22:08:08,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-15 22:08:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:08:08,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,492 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:08,492 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-11-15 22:08:08,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304857483] [2019-11-15 22:08:08,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,539 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-15 22:08:08,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304857483] [2019-11-15 22:08:08,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:08,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:08,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898383393] [2019-11-15 22:08:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:08,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:08,541 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-15 22:08:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,695 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-15 22:08:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:08,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 22:08:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,698 INFO L225 Difference]: With dead ends: 696 [2019-11-15 22:08:08,698 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 22:08:08,699 INFO L600 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-15 22:08:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 22:08:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 22:08:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 22:08:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-15 22:08:08,713 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-15 22:08:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,713 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-15 22:08:08,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-15 22:08:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:08:08,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,715 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:08,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-11-15 22:08:08,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126635401] [2019-11-15 22:08:08,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,745 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-15 22:08:08,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126635401] [2019-11-15 22:08:08,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:08,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:08,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833949575] [2019-11-15 22:08:08,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:08,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:08,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:08,748 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-15 22:08:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:08,919 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-15 22:08:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:08,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-15 22:08:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:08,922 INFO L225 Difference]: With dead ends: 723 [2019-11-15 22:08:08,922 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 22:08:08,923 INFO L600 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-15 22:08:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 22:08:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-15 22:08:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-15 22:08:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-15 22:08:08,936 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-15 22:08:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:08,937 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-15 22:08:08,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-15 22:08:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:08:08,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:08,938 INFO L380 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-15 22:08:08,939 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-11-15 22:08:08,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:08,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709243347] [2019-11-15 22:08:08,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:08,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:08,970 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-15 22:08:08,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709243347] [2019-11-15 22:08:08,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:08,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:08,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218330173] [2019-11-15 22:08:08,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:08,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:08,972 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-15 22:08:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:09,129 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-11-15 22:08:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:09,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:08:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:09,134 INFO L225 Difference]: With dead ends: 741 [2019-11-15 22:08:09,134 INFO L226 Difference]: Without dead ends: 387 [2019-11-15 22:08:09,135 INFO L600 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-15 22:08:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-15 22:08:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-15 22:08:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 22:08:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-15 22:08:09,151 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-15 22:08:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:09,152 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-15 22:08:09,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-15 22:08:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 22:08:09,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:09,154 INFO L380 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-15 22:08:09,154 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:09,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-11-15 22:08:09,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:09,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171355998] [2019-11-15 22:08:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:09,198 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-15 22:08:09,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171355998] [2019-11-15 22:08:09,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:09,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:09,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383376917] [2019-11-15 22:08:09,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:09,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:09,201 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-15 22:08:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:09,364 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-11-15 22:08:09,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:09,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 22:08:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:09,367 INFO L225 Difference]: With dead ends: 762 [2019-11-15 22:08:09,367 INFO L226 Difference]: Without dead ends: 387 [2019-11-15 22:08:09,368 INFO L600 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-15 22:08:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-15 22:08:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-15 22:08:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-15 22:08:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-15 22:08:09,384 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-15 22:08:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:09,384 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-15 22:08:09,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-15 22:08:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 22:08:09,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:09,387 INFO L380 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-15 22:08:09,387 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-11-15 22:08:09,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:09,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525319649] [2019-11-15 22:08:09,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:09,437 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-15 22:08:09,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525319649] [2019-11-15 22:08:09,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:09,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:09,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495746498] [2019-11-15 22:08:09,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:09,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:09,440 INFO L87 Difference]: Start difference. First operand 382 states and 604 transitions. Second operand 3 states. [2019-11-15 22:08:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:09,487 INFO L93 Difference]: Finished difference Result 757 states and 1197 transitions. [2019-11-15 22:08:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:09,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-15 22:08:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:09,493 INFO L225 Difference]: With dead ends: 757 [2019-11-15 22:08:09,493 INFO L226 Difference]: Without dead ends: 755 [2019-11-15 22:08:09,495 INFO L600 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-15 22:08:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-15 22:08:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-11-15 22:08:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-11-15 22:08:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1195 transitions. [2019-11-15 22:08:09,523 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1195 transitions. Word has length 120 [2019-11-15 22:08:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:09,524 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1195 transitions. [2019-11-15 22:08:09,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1195 transitions. [2019-11-15 22:08:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:08:09,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:09,527 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:09,527 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1007661097, now seen corresponding path program 1 times [2019-11-15 22:08:09,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:09,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87488191] [2019-11-15 22:08:09,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 22:08:09,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87488191] [2019-11-15 22:08:09,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:09,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:09,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088291981] [2019-11-15 22:08:09,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:09,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:09,570 INFO L87 Difference]: Start difference. First operand 755 states and 1195 transitions. Second operand 3 states. [2019-11-15 22:08:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:09,627 INFO L93 Difference]: Finished difference Result 1871 states and 2963 transitions. [2019-11-15 22:08:09,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:09,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:08:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:09,634 INFO L225 Difference]: With dead ends: 1871 [2019-11-15 22:08:09,634 INFO L226 Difference]: Without dead ends: 1123 [2019-11-15 22:08:09,635 INFO L600 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-15 22:08:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-15 22:08:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-11-15 22:08:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-15 22:08:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1776 transitions. [2019-11-15 22:08:09,677 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1776 transitions. Word has length 121 [2019-11-15 22:08:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:09,677 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1776 transitions. [2019-11-15 22:08:09,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1776 transitions. [2019-11-15 22:08:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:08:09,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:09,681 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:09,681 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash 381632917, now seen corresponding path program 1 times [2019-11-15 22:08:09,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:09,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771322567] [2019-11-15 22:08:09,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 22:08:09,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771322567] [2019-11-15 22:08:09,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:09,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:09,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995532701] [2019-11-15 22:08:09,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:09,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:09,721 INFO L87 Difference]: Start difference. First operand 1123 states and 1776 transitions. Second operand 3 states. [2019-11-15 22:08:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:09,782 INFO L93 Difference]: Finished difference Result 2590 states and 4096 transitions. [2019-11-15 22:08:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:09,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:08:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:09,791 INFO L225 Difference]: With dead ends: 2590 [2019-11-15 22:08:09,791 INFO L226 Difference]: Without dead ends: 1474 [2019-11-15 22:08:09,793 INFO L600 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-15 22:08:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-11-15 22:08:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2019-11-15 22:08:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-15 22:08:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2327 transitions. [2019-11-15 22:08:09,849 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2327 transitions. Word has length 121 [2019-11-15 22:08:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:09,849 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2327 transitions. [2019-11-15 22:08:09,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2327 transitions. [2019-11-15 22:08:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:08:09,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:09,854 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:09,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2067443667, now seen corresponding path program 1 times [2019-11-15 22:08:09,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:09,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573604703] [2019-11-15 22:08:09,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-15 22:08:09,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573604703] [2019-11-15 22:08:09,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:09,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:09,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886146142] [2019-11-15 22:08:09,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:09,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:09,901 INFO L87 Difference]: Start difference. First operand 1474 states and 2327 transitions. Second operand 3 states. [2019-11-15 22:08:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:10,129 INFO L93 Difference]: Finished difference Result 2981 states and 4691 transitions. [2019-11-15 22:08:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:10,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:08:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:10,138 INFO L225 Difference]: With dead ends: 2981 [2019-11-15 22:08:10,139 INFO L226 Difference]: Without dead ends: 1514 [2019-11-15 22:08:10,141 INFO L600 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-15 22:08:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-11-15 22:08:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1474. [2019-11-15 22:08:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-11-15 22:08:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2183 transitions. [2019-11-15 22:08:10,202 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2183 transitions. Word has length 158 [2019-11-15 22:08:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:10,202 INFO L462 AbstractCegarLoop]: Abstraction has 1474 states and 2183 transitions. [2019-11-15 22:08:10,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2183 transitions. [2019-11-15 22:08:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-15 22:08:10,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:10,207 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:10,207 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1134888427, now seen corresponding path program 1 times [2019-11-15 22:08:10,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:10,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102928564] [2019-11-15 22:08:10,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-15 22:08:10,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102928564] [2019-11-15 22:08:10,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:10,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:10,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731700964] [2019-11-15 22:08:10,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:10,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:10,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:10,258 INFO L87 Difference]: Start difference. First operand 1474 states and 2183 transitions. Second operand 3 states. [2019-11-15 22:08:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:10,473 INFO L93 Difference]: Finished difference Result 3137 states and 4655 transitions. [2019-11-15 22:08:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:10,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-15 22:08:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:10,483 INFO L225 Difference]: With dead ends: 3137 [2019-11-15 22:08:10,483 INFO L226 Difference]: Without dead ends: 1670 [2019-11-15 22:08:10,485 INFO L600 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-15 22:08:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-11-15 22:08:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1554. [2019-11-15 22:08:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-15 22:08:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2243 transitions. [2019-11-15 22:08:10,542 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2243 transitions. Word has length 158 [2019-11-15 22:08:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:10,543 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2243 transitions. [2019-11-15 22:08:10,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2243 transitions. [2019-11-15 22:08:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 22:08:10,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:10,548 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:10,548 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1894065177, now seen corresponding path program 1 times [2019-11-15 22:08:10,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:10,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654667668] [2019-11-15 22:08:10,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-15 22:08:10,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654667668] [2019-11-15 22:08:10,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:10,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:10,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808378640] [2019-11-15 22:08:10,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:10,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:10,607 INFO L87 Difference]: Start difference. First operand 1554 states and 2243 transitions. Second operand 3 states. [2019-11-15 22:08:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:10,880 INFO L93 Difference]: Finished difference Result 3157 states and 4541 transitions. [2019-11-15 22:08:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:10,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-15 22:08:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:10,890 INFO L225 Difference]: With dead ends: 3157 [2019-11-15 22:08:10,890 INFO L226 Difference]: Without dead ends: 1610 [2019-11-15 22:08:10,892 INFO L600 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-15 22:08:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-11-15 22:08:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1554. [2019-11-15 22:08:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-15 22:08:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2181 transitions. [2019-11-15 22:08:10,948 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2181 transitions. Word has length 172 [2019-11-15 22:08:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:10,948 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 2181 transitions. [2019-11-15 22:08:10,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2181 transitions. [2019-11-15 22:08:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:08:10,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:10,953 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:10,953 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash -313542519, now seen corresponding path program 1 times [2019-11-15 22:08:10,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:10,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778912575] [2019-11-15 22:08:10,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:10,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:08:11,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778912575] [2019-11-15 22:08:11,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:11,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:11,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479941277] [2019-11-15 22:08:11,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:11,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:11,011 INFO L87 Difference]: Start difference. First operand 1554 states and 2181 transitions. Second operand 3 states. [2019-11-15 22:08:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:11,194 INFO L93 Difference]: Finished difference Result 3186 states and 4458 transitions. [2019-11-15 22:08:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:11,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-15 22:08:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:11,204 INFO L225 Difference]: With dead ends: 3186 [2019-11-15 22:08:11,204 INFO L226 Difference]: Without dead ends: 1639 [2019-11-15 22:08:11,206 INFO L600 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-15 22:08:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-11-15 22:08:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-11-15 22:08:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-11-15 22:08:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2265 transitions. [2019-11-15 22:08:11,263 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2265 transitions. Word has length 188 [2019-11-15 22:08:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2265 transitions. [2019-11-15 22:08:11,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2265 transitions. [2019-11-15 22:08:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-15 22:08:11,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:11,269 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:11,269 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1889247393, now seen corresponding path program 1 times [2019-11-15 22:08:11,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:11,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104345089] [2019-11-15 22:08:11,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-11-15 22:08:11,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104345089] [2019-11-15 22:08:11,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:11,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:11,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824906273] [2019-11-15 22:08:11,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:11,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:11,341 INFO L87 Difference]: Start difference. First operand 1623 states and 2265 transitions. Second operand 3 states. [2019-11-15 22:08:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:11,523 INFO L93 Difference]: Finished difference Result 3391 states and 4735 transitions. [2019-11-15 22:08:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:11,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-15 22:08:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:11,534 INFO L225 Difference]: With dead ends: 3391 [2019-11-15 22:08:11,534 INFO L226 Difference]: Without dead ends: 1775 [2019-11-15 22:08:11,537 INFO L600 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-15 22:08:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-11-15 22:08:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1723. [2019-11-15 22:08:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-15 22:08:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2385 transitions. [2019-11-15 22:08:11,597 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2385 transitions. Word has length 209 [2019-11-15 22:08:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:11,598 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2385 transitions. [2019-11-15 22:08:11,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2385 transitions. [2019-11-15 22:08:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 22:08:11,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:11,603 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:11,603 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 627964964, now seen corresponding path program 1 times [2019-11-15 22:08:11,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:11,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767695851] [2019-11-15 22:08:11,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 22:08:11,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767695851] [2019-11-15 22:08:11,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:11,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:11,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98568249] [2019-11-15 22:08:11,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:11,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:11,672 INFO L87 Difference]: Start difference. First operand 1723 states and 2385 transitions. Second operand 3 states. [2019-11-15 22:08:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:11,893 INFO L93 Difference]: Finished difference Result 3493 states and 4821 transitions. [2019-11-15 22:08:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:11,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-15 22:08:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:11,904 INFO L225 Difference]: With dead ends: 3493 [2019-11-15 22:08:11,904 INFO L226 Difference]: Without dead ends: 1777 [2019-11-15 22:08:11,906 INFO L600 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-15 22:08:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2019-11-15 22:08:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1723. [2019-11-15 22:08:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-15 22:08:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2377 transitions. [2019-11-15 22:08:11,969 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2377 transitions. Word has length 212 [2019-11-15 22:08:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:11,970 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 2377 transitions. [2019-11-15 22:08:11,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2377 transitions. [2019-11-15 22:08:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 22:08:11,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:11,976 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:11,976 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:11,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 575806657, now seen corresponding path program 1 times [2019-11-15 22:08:11,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:11,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181112960] [2019-11-15 22:08:11,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:11,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-15 22:08:12,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181112960] [2019-11-15 22:08:12,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:12,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:12,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041672447] [2019-11-15 22:08:12,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:12,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:12,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:12,060 INFO L87 Difference]: Start difference. First operand 1723 states and 2377 transitions. Second operand 3 states. [2019-11-15 22:08:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:12,296 INFO L93 Difference]: Finished difference Result 3635 states and 5035 transitions. [2019-11-15 22:08:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:12,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-15 22:08:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:12,306 INFO L225 Difference]: With dead ends: 3635 [2019-11-15 22:08:12,307 INFO L226 Difference]: Without dead ends: 1819 [2019-11-15 22:08:12,310 INFO L600 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-15 22:08:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-11-15 22:08:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1779. [2019-11-15 22:08:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:08:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2421 transitions. [2019-11-15 22:08:12,375 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2421 transitions. Word has length 233 [2019-11-15 22:08:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:12,376 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2421 transitions. [2019-11-15 22:08:12,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2421 transitions. [2019-11-15 22:08:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 22:08:12,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:12,382 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:12,382 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash 274134262, now seen corresponding path program 1 times [2019-11-15 22:08:12,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:12,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109407889] [2019-11-15 22:08:12,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:12,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:12,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 22:08:12,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109407889] [2019-11-15 22:08:12,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:12,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:12,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798820835] [2019-11-15 22:08:12,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:12,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:12,457 INFO L87 Difference]: Start difference. First operand 1779 states and 2421 transitions. Second operand 3 states. [2019-11-15 22:08:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:12,640 INFO L93 Difference]: Finished difference Result 3583 states and 4883 transitions. [2019-11-15 22:08:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:12,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-15 22:08:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:12,651 INFO L225 Difference]: With dead ends: 3583 [2019-11-15 22:08:12,651 INFO L226 Difference]: Without dead ends: 1811 [2019-11-15 22:08:12,653 INFO L600 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-15 22:08:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-15 22:08:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1779. [2019-11-15 22:08:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-11-15 22:08:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2401 transitions. [2019-11-15 22:08:12,721 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2401 transitions. Word has length 235 [2019-11-15 22:08:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:12,722 INFO L462 AbstractCegarLoop]: Abstraction has 1779 states and 2401 transitions. [2019-11-15 22:08:12,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2401 transitions. [2019-11-15 22:08:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 22:08:12,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:12,728 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:12,728 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2133876990, now seen corresponding path program 1 times [2019-11-15 22:08:12,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:12,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554550592] [2019-11-15 22:08:12,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:12,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:12,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 22:08:12,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554550592] [2019-11-15 22:08:12,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100383123] [2019-11-15 22:08:12,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:12,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:12,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 22:08:13,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:08:13,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:08:13,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874933798] [2019-11-15 22:08:13,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:13,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:13,059 INFO L87 Difference]: Start difference. First operand 1779 states and 2401 transitions. Second operand 3 states. [2019-11-15 22:08:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:13,150 INFO L93 Difference]: Finished difference Result 3573 states and 4829 transitions. [2019-11-15 22:08:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:13,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-11-15 22:08:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:13,163 INFO L225 Difference]: With dead ends: 3573 [2019-11-15 22:08:13,163 INFO L226 Difference]: Without dead ends: 2234 [2019-11-15 22:08:13,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-11-15 22:08:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2234. [2019-11-15 22:08:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-11-15 22:08:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3016 transitions. [2019-11-15 22:08:13,245 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3016 transitions. Word has length 245 [2019-11-15 22:08:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:13,245 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 3016 transitions. [2019-11-15 22:08:13,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3016 transitions. [2019-11-15 22:08:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:08:13,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:13,253 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:13,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:13,458 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash -207038505, now seen corresponding path program 1 times [2019-11-15 22:08:13,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:13,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882150088] [2019-11-15 22:08:13,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:13,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:13,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:08:13,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882150088] [2019-11-15 22:08:13,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523851609] [2019-11-15 22:08:13,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:13,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:13,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:08:13,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:13,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:08:13,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861030646] [2019-11-15 22:08:13,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:08:13,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:13,852 INFO L87 Difference]: Start difference. First operand 2234 states and 3016 transitions. Second operand 4 states. [2019-11-15 22:08:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:14,371 INFO L93 Difference]: Finished difference Result 7148 states and 9660 transitions. [2019-11-15 22:08:14,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:08:14,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-15 22:08:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:14,405 INFO L225 Difference]: With dead ends: 7148 [2019-11-15 22:08:14,405 INFO L226 Difference]: Without dead ends: 4921 [2019-11-15 22:08:14,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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-15 22:08:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2019-11-15 22:08:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 2779. [2019-11-15 22:08:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-11-15 22:08:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3666 transitions. [2019-11-15 22:08:14,525 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3666 transitions. Word has length 252 [2019-11-15 22:08:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:14,526 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3666 transitions. [2019-11-15 22:08:14,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:08:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3666 transitions. [2019-11-15 22:08:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-15 22:08:14,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:14,535 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:14,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:14,740 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash 81780885, now seen corresponding path program 1 times [2019-11-15 22:08:14,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:14,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901781918] [2019-11-15 22:08:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:14,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:14,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 22:08:14,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901781918] [2019-11-15 22:08:14,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:14,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:14,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870701816] [2019-11-15 22:08:14,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:14,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:14,840 INFO L87 Difference]: Start difference. First operand 2779 states and 3666 transitions. Second operand 3 states. [2019-11-15 22:08:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:14,967 INFO L93 Difference]: Finished difference Result 7808 states and 10356 transitions. [2019-11-15 22:08:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:14,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-15 22:08:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:14,977 INFO L225 Difference]: With dead ends: 7808 [2019-11-15 22:08:14,977 INFO L226 Difference]: Without dead ends: 5036 [2019-11-15 22:08:14,982 INFO L600 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-15 22:08:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-15 22:08:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5034. [2019-11-15 22:08:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-15 22:08:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6686 transitions. [2019-11-15 22:08:15,155 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6686 transitions. Word has length 252 [2019-11-15 22:08:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:15,155 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6686 transitions. [2019-11-15 22:08:15,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6686 transitions. [2019-11-15 22:08:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-15 22:08:15,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:15,165 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:15,166 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751562, now seen corresponding path program 1 times [2019-11-15 22:08:15,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:15,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559844381] [2019-11-15 22:08:15,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:15,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 22:08:15,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559844381] [2019-11-15 22:08:15,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:15,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:15,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189627007] [2019-11-15 22:08:15,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:15,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:15,249 INFO L87 Difference]: Start difference. First operand 5034 states and 6686 transitions. Second operand 3 states. [2019-11-15 22:08:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:15,591 INFO L93 Difference]: Finished difference Result 10161 states and 13481 transitions. [2019-11-15 22:08:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:15,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-15 22:08:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:15,600 INFO L225 Difference]: With dead ends: 10161 [2019-11-15 22:08:15,601 INFO L226 Difference]: Without dead ends: 5134 [2019-11-15 22:08:15,608 INFO L600 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-15 22:08:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2019-11-15 22:08:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5034. [2019-11-15 22:08:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-15 22:08:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6600 transitions. [2019-11-15 22:08:15,775 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6600 transitions. Word has length 255 [2019-11-15 22:08:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:15,775 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6600 transitions. [2019-11-15 22:08:15,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6600 transitions. [2019-11-15 22:08:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 22:08:15,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:15,786 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:15,786 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1038896286, now seen corresponding path program 1 times [2019-11-15 22:08:15,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:15,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367712698] [2019-11-15 22:08:15,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:15,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:15,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 22:08:15,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367712698] [2019-11-15 22:08:15,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919166955] [2019-11-15 22:08:15,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:15,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:16,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-15 22:08:16,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:08:16,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:08:16,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239899054] [2019-11-15 22:08:16,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:16,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:16,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:16,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:16,080 INFO L87 Difference]: Start difference. First operand 5034 states and 6600 transitions. Second operand 3 states. [2019-11-15 22:08:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:16,321 INFO L93 Difference]: Finished difference Result 10081 states and 13209 transitions. [2019-11-15 22:08:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:16,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-15 22:08:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:16,331 INFO L225 Difference]: With dead ends: 10081 [2019-11-15 22:08:16,331 INFO L226 Difference]: Without dead ends: 5054 [2019-11-15 22:08:16,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-11-15 22:08:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 5034. [2019-11-15 22:08:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-15 22:08:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6590 transitions. [2019-11-15 22:08:16,503 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6590 transitions. Word has length 281 [2019-11-15 22:08:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:16,504 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6590 transitions. [2019-11-15 22:08:16,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6590 transitions. [2019-11-15 22:08:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-15 22:08:16,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:16,515 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:16,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:16,720 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1898466533, now seen corresponding path program 1 times [2019-11-15 22:08:16,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:16,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381772323] [2019-11-15 22:08:16,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:16,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 22:08:16,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381772323] [2019-11-15 22:08:16,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336353929] [2019-11-15 22:08:16,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:16,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:16,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 22:08:17,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:08:17,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:08:17,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561173512] [2019-11-15 22:08:17,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:17,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:17,062 INFO L87 Difference]: Start difference. First operand 5034 states and 6590 transitions. Second operand 3 states. [2019-11-15 22:08:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:17,349 INFO L93 Difference]: Finished difference Result 10061 states and 13169 transitions. [2019-11-15 22:08:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:17,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-15 22:08:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:17,359 INFO L225 Difference]: With dead ends: 10061 [2019-11-15 22:08:17,359 INFO L226 Difference]: Without dead ends: 5034 [2019-11-15 22:08:17,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-15 22:08:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 5034. [2019-11-15 22:08:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-11-15 22:08:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6580 transitions. [2019-11-15 22:08:17,517 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6580 transitions. Word has length 282 [2019-11-15 22:08:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:17,517 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 6580 transitions. [2019-11-15 22:08:17,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6580 transitions. [2019-11-15 22:08:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-15 22:08:17,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:17,529 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:17,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:17,734 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 89999279, now seen corresponding path program 1 times [2019-11-15 22:08:17,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:17,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234972283] [2019-11-15 22:08:17,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:17,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:17,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 22:08:17,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234972283] [2019-11-15 22:08:17,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2945171] [2019-11-15 22:08:17,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:17,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:17,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 22:08:18,001 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:18,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:08:18,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784039015] [2019-11-15 22:08:18,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:08:18,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:18,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:18,004 INFO L87 Difference]: Start difference. First operand 5034 states and 6580 transitions. Second operand 4 states. [2019-11-15 22:08:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:18,442 INFO L93 Difference]: Finished difference Result 11805 states and 15365 transitions. [2019-11-15 22:08:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:08:18,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-15 22:08:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:18,455 INFO L225 Difference]: With dead ends: 11805 [2019-11-15 22:08:18,455 INFO L226 Difference]: Without dead ends: 6712 [2019-11-15 22:08:18,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 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-15 22:08:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-15 22:08:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 4418. [2019-11-15 22:08:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2019-11-15 22:08:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 5699 transitions. [2019-11-15 22:08:18,610 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 5699 transitions. Word has length 282 [2019-11-15 22:08:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:18,611 INFO L462 AbstractCegarLoop]: Abstraction has 4418 states and 5699 transitions. [2019-11-15 22:08:18,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:08:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 5699 transitions. [2019-11-15 22:08:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-11-15 22:08:18,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:18,624 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:18,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:18,828 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash -68994562, now seen corresponding path program 1 times [2019-11-15 22:08:18,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:18,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103736479] [2019-11-15 22:08:18,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:18,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:18,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-11-15 22:08:18,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103736479] [2019-11-15 22:08:18,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:18,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:18,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28868555] [2019-11-15 22:08:18,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:18,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:18,944 INFO L87 Difference]: Start difference. First operand 4418 states and 5699 transitions. Second operand 3 states. [2019-11-15 22:08:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:19,116 INFO L93 Difference]: Finished difference Result 7454 states and 9509 transitions. [2019-11-15 22:08:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-11-15 22:08:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:19,121 INFO L225 Difference]: With dead ends: 7454 [2019-11-15 22:08:19,121 INFO L226 Difference]: Without dead ends: 2235 [2019-11-15 22:08:19,127 INFO L600 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-15 22:08:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2019-11-15 22:08:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 2235. [2019-11-15 22:08:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-15 22:08:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2837 transitions. [2019-11-15 22:08:19,188 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2837 transitions. Word has length 320 [2019-11-15 22:08:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:19,188 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2837 transitions. [2019-11-15 22:08:19,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2837 transitions. [2019-11-15 22:08:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-15 22:08:19,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:19,197 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:19,197 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 439442017, now seen corresponding path program 1 times [2019-11-15 22:08:19,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:19,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982847547] [2019-11-15 22:08:19,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:19,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:19,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-11-15 22:08:19,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982847547] [2019-11-15 22:08:19,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:19,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:19,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721417961] [2019-11-15 22:08:19,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:19,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:19,366 INFO L87 Difference]: Start difference. First operand 2235 states and 2837 transitions. Second operand 3 states. [2019-11-15 22:08:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:19,535 INFO L93 Difference]: Finished difference Result 4473 states and 5673 transitions. [2019-11-15 22:08:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:19,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-15 22:08:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:19,539 INFO L225 Difference]: With dead ends: 4473 [2019-11-15 22:08:19,540 INFO L226 Difference]: Without dead ends: 2245 [2019-11-15 22:08:19,543 INFO L600 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-15 22:08:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-15 22:08:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2235. [2019-11-15 22:08:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-11-15 22:08:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2812 transitions. [2019-11-15 22:08:19,600 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2812 transitions. Word has length 359 [2019-11-15 22:08:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:19,601 INFO L462 AbstractCegarLoop]: Abstraction has 2235 states and 2812 transitions. [2019-11-15 22:08:19,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2812 transitions. [2019-11-15 22:08:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-15 22:08:19,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:19,611 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:19,611 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1924130447, now seen corresponding path program 1 times [2019-11-15 22:08:19,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:19,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159734445] [2019-11-15 22:08:19,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:19,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:19,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-15 22:08:19,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159734445] [2019-11-15 22:08:19,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032741209] [2019-11-15 22:08:19,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:19,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:19,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-11-15 22:08:20,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:08:20,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:08:20,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49648558] [2019-11-15 22:08:20,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:20,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:20,031 INFO L87 Difference]: Start difference. First operand 2235 states and 2812 transitions. Second operand 3 states. [2019-11-15 22:08:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:20,090 INFO L93 Difference]: Finished difference Result 2854 states and 3617 transitions. [2019-11-15 22:08:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:20,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-11-15 22:08:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:20,096 INFO L225 Difference]: With dead ends: 2854 [2019-11-15 22:08:20,096 INFO L226 Difference]: Without dead ends: 2762 [2019-11-15 22:08:20,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:08:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-11-15 22:08:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2145. [2019-11-15 22:08:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-11-15 22:08:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2711 transitions. [2019-11-15 22:08:20,159 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2711 transitions. Word has length 392 [2019-11-15 22:08:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:20,159 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 2711 transitions. [2019-11-15 22:08:20,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2711 transitions. [2019-11-15 22:08:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-11-15 22:08:20,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:20,167 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:20,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:20,371 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -820757555, now seen corresponding path program 1 times [2019-11-15 22:08:20,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:20,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99885629] [2019-11-15 22:08:20,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:20,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:20,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-15 22:08:20,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99885629] [2019-11-15 22:08:20,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911355952] [2019-11-15 22:08:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:20,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:20,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-11-15 22:08:21,008 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:21,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:08:21,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603686928] [2019-11-15 22:08:21,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:08:21,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:21,010 INFO L87 Difference]: Start difference. First operand 2145 states and 2711 transitions. Second operand 4 states. [2019-11-15 22:08:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:21,371 INFO L93 Difference]: Finished difference Result 5211 states and 6595 transitions. [2019-11-15 22:08:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:08:21,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-11-15 22:08:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:21,378 INFO L225 Difference]: With dead ends: 5211 [2019-11-15 22:08:21,378 INFO L226 Difference]: Without dead ends: 3031 [2019-11-15 22:08:21,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 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-15 22:08:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2019-11-15 22:08:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2205. [2019-11-15 22:08:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-15 22:08:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2791 transitions. [2019-11-15 22:08:21,445 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2791 transitions. Word has length 532 [2019-11-15 22:08:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:21,446 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 2791 transitions. [2019-11-15 22:08:21,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:08:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2791 transitions. [2019-11-15 22:08:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-15 22:08:21,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:21,453 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:21,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:21,666 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash -751360217, now seen corresponding path program 1 times [2019-11-15 22:08:21,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:21,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566025333] [2019-11-15 22:08:21,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:21,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:21,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-11-15 22:08:21,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566025333] [2019-11-15 22:08:21,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:21,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:21,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113294486] [2019-11-15 22:08:21,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:21,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:21,951 INFO L87 Difference]: Start difference. First operand 2205 states and 2791 transitions. Second operand 3 states. [2019-11-15 22:08:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:22,141 INFO L93 Difference]: Finished difference Result 4583 states and 5811 transitions. [2019-11-15 22:08:22,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:22,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 594 [2019-11-15 22:08:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:22,146 INFO L225 Difference]: With dead ends: 4583 [2019-11-15 22:08:22,146 INFO L226 Difference]: Without dead ends: 2385 [2019-11-15 22:08:22,149 INFO L600 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-15 22:08:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-11-15 22:08:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2375. [2019-11-15 22:08:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2019-11-15 22:08:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2986 transitions. [2019-11-15 22:08:22,211 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2986 transitions. Word has length 594 [2019-11-15 22:08:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:22,212 INFO L462 AbstractCegarLoop]: Abstraction has 2375 states and 2986 transitions. [2019-11-15 22:08:22,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2986 transitions. [2019-11-15 22:08:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-11-15 22:08:22,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:22,220 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:22,221 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1835833869, now seen corresponding path program 1 times [2019-11-15 22:08:22,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:22,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257152683] [2019-11-15 22:08:22,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-11-15 22:08:22,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257152683] [2019-11-15 22:08:22,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:22,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:08:22,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261250537] [2019-11-15 22:08:22,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:08:22,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:08:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:08:22,516 INFO L87 Difference]: Start difference. First operand 2375 states and 2986 transitions. Second operand 3 states. [2019-11-15 22:08:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:22,695 INFO L93 Difference]: Finished difference Result 4738 states and 5951 transitions. [2019-11-15 22:08:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:08:22,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 656 [2019-11-15 22:08:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:22,700 INFO L225 Difference]: With dead ends: 4738 [2019-11-15 22:08:22,700 INFO L226 Difference]: Without dead ends: 2370 [2019-11-15 22:08:22,702 INFO L600 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-15 22:08:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-11-15 22:08:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2019-11-15 22:08:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-11-15 22:08:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2931 transitions. [2019-11-15 22:08:22,764 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2931 transitions. Word has length 656 [2019-11-15 22:08:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:22,765 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 2931 transitions. [2019-11-15 22:08:22,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:08:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2931 transitions. [2019-11-15 22:08:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-15 22:08:22,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:08:22,773 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:22,773 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:08:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1388787143, now seen corresponding path program 1 times [2019-11-15 22:08:22,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:22,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158530639] [2019-11-15 22:08:22,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:22,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-15 22:08:23,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158530639] [2019-11-15 22:08:23,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227343623] [2019-11-15 22:08:23,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/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-15 22:08:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:23,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:08:23,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-11-15 22:08:23,726 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:23,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 22:08:23,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632667731] [2019-11-15 22:08:23,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:08:23,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:23,729 INFO L87 Difference]: Start difference. First operand 2370 states and 2931 transitions. Second operand 4 states. [2019-11-15 22:08:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:23,937 INFO L93 Difference]: Finished difference Result 4080 states and 5087 transitions. [2019-11-15 22:08:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:08:23,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 722 [2019-11-15 22:08:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:08:23,938 INFO L225 Difference]: With dead ends: 4080 [2019-11-15 22:08:23,938 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:08:23,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 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-15 22:08:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:08:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:08:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:08:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:08:23,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 722 [2019-11-15 22:08:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:08:23,943 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:23,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:08:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:08:23,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:08:24,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:24,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:08:24,496 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2019-11-15 22:08:25,492 WARN L191 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-15 22:08:26,580 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 256 [2019-11-15 22:08:27,067 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-15 22:08:27,455 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-15 22:08:27,794 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 34 [2019-11-15 22:08:28,362 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 49 [2019-11-15 22:08:28,552 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 29 [2019-11-15 22:08:28,776 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-11-15 22:08:32,055 WARN L191 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 213 DAG size of output: 111 [2019-11-15 22:08:32,323 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-11-15 22:08:32,519 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-11-15 22:08:32,712 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-15 22:08:32,952 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-15 22:08:33,196 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-15 22:08:33,442 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-15 22:08:33,679 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-11-15 22:08:33,822 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-11-15 22:08:34,081 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 27 [2019-11-15 22:08:34,469 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 24 [2019-11-15 22:08:37,418 WARN L191 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 213 DAG size of output: 111 [2019-11-15 22:08:37,711 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2019-11-15 22:08:37,970 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2019-11-15 22:08:38,276 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-11-15 22:08:38,277 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 435) no Hoare annotation was computed. [2019-11-15 22:08:38,277 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 371) no Hoare annotation was computed. [2019-11-15 22:08:38,278 INFO L439 ceAbstractionStarter]: At program point L201(lines 197 546) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse1 .cse2 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse3 .cse4) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse4))) [2019-11-15 22:08:38,278 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 578) the Hoare annotation is: false [2019-11-15 22:08:38,278 INFO L446 ceAbstractionStarter]: At program point L598(lines 97 599) the Hoare annotation is: true [2019-11-15 22:08:38,278 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 534) no Hoare annotation was computed. [2019-11-15 22:08:38,278 INFO L439 ceAbstractionStarter]: At program point L400(lines 391 409) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-15 22:08:38,278 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 544) no Hoare annotation was computed. [2019-11-15 22:08:38,278 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 555) no Hoare annotation was computed. [2019-11-15 22:08:38,278 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 566) no Hoare annotation was computed. [2019-11-15 22:08:38,278 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 577) no Hoare annotation was computed. [2019-11-15 22:08:38,279 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 370) no Hoare annotation was computed. [2019-11-15 22:08:38,279 INFO L443 ceAbstractionStarter]: For program point L336-1(lines 336 370) no Hoare annotation was computed. [2019-11-15 22:08:38,279 INFO L439 ceAbstractionStarter]: At program point L204(lines 203 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:08:38,281 INFO L439 ceAbstractionStarter]: At program point L171(lines 167 556) 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 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-15 22:08:38,281 INFO L439 ceAbstractionStarter]: At program point L138(lines 134 567) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse8) (and .cse9 (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7))) [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 471) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 367) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L439 ceAbstractionStarter]: At program point L206(lines 205 544) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 554) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 565) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 576) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 605) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L603-2(lines 603 605) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 507) no Hoare annotation was computed. [2019-11-15 22:08:38,281 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 275) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L273-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 314) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 607) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 252) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 553) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 564) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 575) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 365) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 246) no Hoare annotation was computed. [2019-11-15 22:08:38,282 INFO L439 ceAbstractionStarter]: At program point L210(lines 104 577) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10))) [2019-11-15 22:08:38,282 INFO L439 ceAbstractionStarter]: At program point L177(lines 173 554) 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 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-15 22:08:38,283 INFO L439 ceAbstractionStarter]: At program point L144(lines 140 565) 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 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2 .cse3 .cse4) .cse5) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5))) [2019-11-15 22:08:38,283 INFO L446 ceAbstractionStarter]: At program point L608(lines 10 610) the Hoare annotation is: true [2019-11-15 22:08:38,283 INFO L439 ceAbstractionStarter]: At program point L542(lines 98 597) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse7 (and .cse0 .cse20 .cse21 .cse30 .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (and .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse21 .cse30 .cse26)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse16 (and .cse19 .cse20 .cse21 .cse30 .cse26)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not .cse3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3) (and .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse14 .cse15) (and .cse8 .cse16) (and .cse9 .cse17 .cse11 .cse4) (and .cse10 .cse4 .cse5 .cse15 .cse13) (and .cse1 (and .cse9 .cse10 .cse11 .cse4 .cse12)) (and (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse2) (and .cse19 .cse26 .cse27) (and (and .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse25) .cse2) (and .cse17 .cse26 .cse27) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse3) (and .cse28 .cse8) (and .cse0 .cse3 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse3) (and .cse6 .cse28) (and .cse0 .cse26 .cse27 .cse13) (and .cse0 .cse4 .cse5 .cse13) (and .cse6 .cse16) (and .cse0 .cse14) (and .cse9 .cse11 .cse4 .cse19) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18 .cse15 .cse29 .cse13) (and .cse1 .cse19 .cse2) (and .cse1 .cse17 .cse2) (and .cse10 .cse18 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse29) (and .cse0 .cse1 .cse26 .cse27) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse3) (and .cse15 .cse26 .cse27 .cse13)))) [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 445) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 552) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 563) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 574) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-15 22:08:38,283 INFO L443 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 87) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 411) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 514) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 455) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 386) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 217) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 551) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 562) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 215 217) no Hoare annotation was computed. [2019-11-15 22:08:38,284 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 573) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 595) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L439 ceAbstractionStarter]: At program point L513(lines 71 609) the Hoare annotation is: false [2019-11-15 22:08:38,287 INFO L439 ceAbstractionStarter]: At program point L183(lines 179 552) the Hoare annotation is: (let ((.cse0 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2019-11-15 22:08:38,287 INFO L439 ceAbstractionStarter]: At program point L150(lines 146 563) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5)) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0))) [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 86) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L84-2(lines 81 87) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 594) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 485) no Hoare annotation was computed. [2019-11-15 22:08:38,287 INFO L443 ceAbstractionStarter]: For program point L481-2(lines 481 485) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 517) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point L581-2(lines 580 594) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 550) no Hoare annotation was computed. [2019-11-15 22:08:38,288 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 561) no Hoare annotation was computed. [2019-11-15 22:08:38,289 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 572) no Hoare annotation was computed. [2019-11-15 22:08:38,289 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 452) no Hoare annotation was computed. [2019-11-15 22:08:38,289 INFO L439 ceAbstractionStarter]: At program point L120(lines 116 573) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.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 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-15 22:08:38,289 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 585) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 361) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 549) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 560) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 571) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 93) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 71 609) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L443 ceAbstractionStarter]: For program point L519-2(lines 519 523) no Hoare annotation was computed. [2019-11-15 22:08:38,291 INFO L439 ceAbstractionStarter]: At program point L354(lines 330 372) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 (and .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5)) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2 .cse3 .cse4 .cse5) .cse0))) [2019-11-15 22:08:38,291 INFO L439 ceAbstractionStarter]: At program point L189(lines 185 550) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse2 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse1 .cse2 .cse3))) [2019-11-15 22:08:38,292 INFO L439 ceAbstractionStarter]: At program point L156(lines 152 561) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-15 22:08:38,292 INFO L439 ceAbstractionStarter]: At program point L123(lines 122 571) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse8 .cse9 .cse10) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 92) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L421(lines 421 423) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L439 ceAbstractionStarter]: At program point L388(lines 379 411) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and .cse3 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) .cse3))) [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 291) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L289-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L446 ceAbstractionStarter]: At program point L620(lines 611 622) the Hoare annotation is: true [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 548) no Hoare annotation was computed. [2019-11-15 22:08:38,292 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 559) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 570) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L588(lines 588 592) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 260) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 236) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L225-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 409) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 494) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 547) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 558) no Hoare annotation was computed. [2019-11-15 22:08:38,293 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 569) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L439 ceAbstractionStarter]: At program point L195(lines 191 548) the Hoare annotation is: (let ((.cse4 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse4) (and .cse1 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (and .cse0 .cse1 .cse2 .cse3)))) [2019-11-15 22:08:38,294 INFO L439 ceAbstractionStarter]: At program point L162(lines 158 559) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse0 .cse1 .cse2 .cse3) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse1 .cse2 .cse3))) [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 300) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 296 300) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 546) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 557) no Hoare annotation was computed. [2019-11-15 22:08:38,294 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 568) no Hoare annotation was computed. [2019-11-15 22:08:38,295 INFO L439 ceAbstractionStarter]: At program point L98-2(lines 98 597) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse19 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse17 (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse30 (<= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (let ((.cse7 (and .cse0 .cse20 .cse21 .cse30 .cse26)) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse22 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse23 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse28 (and .cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) .cse20 .cse21 .cse30 .cse26)) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (.cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (.cse16 (and .cse19 .cse20 .cse21 .cse30 .cse26)) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 3)) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse18 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse29 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640)) (.cse27 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse13 (not .cse3))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3) (and .cse9 .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse14 .cse15) (and .cse8 .cse16) (and .cse9 .cse17 .cse11 .cse4) (and .cse10 .cse4 .cse5 .cse15 .cse13) (and .cse1 (and .cse9 .cse10 .cse11 .cse4 .cse12)) (and (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse2) (and .cse19 .cse26 .cse27) (and (and .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) .cse25) .cse2) (and .cse17 .cse26 .cse27) (and (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse3) (and .cse28 .cse8) (and .cse0 .cse3 (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8512) .cse3) (and .cse6 .cse28) (and .cse0 .cse26 .cse27 .cse13) (and .cse0 .cse4 .cse5 .cse13) (and .cse6 .cse16) (and .cse0 .cse14) (and .cse9 .cse11 .cse4 .cse19) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse18 .cse15 .cse29 .cse13) (and .cse1 .cse19 .cse2) (and .cse1 .cse17 .cse2) (and .cse10 .cse18 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse29) (and .cse0 .cse1 .cse26 .cse27) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8544) .cse3) (and .cse15 .cse26 .cse27 .cse13)))) [2019-11-15 22:08:38,295 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 429 437) no Hoare annotation was computed. [2019-11-15 22:08:38,295 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 234) no Hoare annotation was computed. [2019-11-15 22:08:38,295 INFO L439 ceAbstractionStarter]: At program point L165(lines 164 557) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2) (and .cse0 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8640) .cse2 (not .cse3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse3 .cse1 .cse2))) [2019-11-15 22:08:38,296 INFO L439 ceAbstractionStarter]: At program point L132(lines 125 570) the Hoare annotation is: (let ((.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (and (= 0 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) .cse9) (and (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) .cse9))) [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 535) no Hoare annotation was computed. [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 529 535) no Hoare annotation was computed. [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L496-2(lines 207 541) no Hoare annotation was computed. [2019-11-15 22:08:38,296 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 545) no Hoare annotation was computed. [2019-11-15 22:08:38,298 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 556) no Hoare annotation was computed. [2019-11-15 22:08:38,298 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 567) no Hoare annotation was computed. [2019-11-15 22:08:38,298 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 578) no Hoare annotation was computed. [2019-11-15 22:08:38,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:08:38 BoogieIcfgContainer [2019-11-15 22:08:38,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:08:38,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:08:38,368 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:08:38,368 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:08:38,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:05" (3/4) ... [2019-11-15 22:08:38,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:08:38,400 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:08:38,401 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:08:38,566 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53a219a3-63fa-408f-b2f1-4eb0046f8967/bin/uautomizer/witness.graphml [2019-11-15 22:08:38,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:08:38,567 INFO L168 Benchmark]: Toolchain (without parser) took 34834.46 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 944.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 265.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,567 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:08:38,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.41 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,568 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 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-15 22:08:38,569 INFO L168 Benchmark]: RCFGBuilder took 924.67 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,569 INFO L168 Benchmark]: TraceAbstraction took 33180.59 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,569 INFO L168 Benchmark]: Witness Printer took 198.60 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:38,571 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.41 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 924.67 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: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33180.59 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 198.60 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 607]: 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: 140]: Loop Invariant Derived loop invariant: (((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && ((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) || ((s__s3__tmp__next_state___0 <= 8576 && (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) && 0 == s__hit)) || ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 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 == 8480)) && s__state <= 8576) && 0 == s__hit) || ((s__s3__tmp__next_state___0 <= 8576 && ((((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && ((((((((0 == blastFlag && !(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)) && s__state <= 8576) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 3 && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(s__state == 8656)) && !(0 == s__hit)) || ((((!(s__state == 8657) && 8656 <= s__state) && blastFlag == 1) && !(s__state == 12292)) && !(s__state == 8656))) || ((((0 == blastFlag && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && !(s__state == 8656))) || (((((blastFlag <= 3 && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 12292)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((8448 <= s__state && ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && s__state <= 8576) || (((s__s3__tmp__next_state___0 <= 8576 && (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576) && 0 == s__hit)) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656)) && !(0 == s__hit))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (8608 == s__state && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656))) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 8608 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 8560 == s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || (s__state == 8592 && ((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(0 == s__hit))) || (s__state == 8592 && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && (((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) && 0 == s__hit) || ((((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8640) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((blastFlag == 1 && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) || ((((0 == blastFlag && !(s__state == 8545)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576)) || (((((blastFlag <= 2 && !(s__state == 8545)) && 0 == s__hit) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) || ((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576)) || ((((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) && !(0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8672)) && 8656 <= s__state)) || (((s__state <= 8672 && !(s__state == 8672)) && 8656 <= s__state) && blastFlag == 1)) || (s__s3__tmp__next_state___0 <= 8576 && ((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8672)) && 8656 <= s__state) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((0 == blastFlag && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) || (((8448 <= s__state && blastFlag == 1) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((((blastFlag <= 2 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((8448 <= s__state && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && s__s3__tmp__next_state___0 <= 8640) && !(s__state == 8496)) && s__state <= 8640) && !(s__state == 8480)) || (((((((((((blastFlag <= 2 && 8448 <= s__state) && !(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 <= 8640) && !(s__state == 8480)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((0 == blastFlag && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) || ((s__state <= 8576 && ((blastFlag <= 2 && !(s__state == 8560)) && 8512 <= s__state) && !(s__state == 8561)) && 0 == s__hit)) || ((((!(s__state == 8560) && blastFlag == 1) && 8512 <= s__state) && !(s__state == 8561)) && s__state <= 8576) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && 0 == s__hit) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8656)) || (((s__s3__tmp__next_state___0 <= 8576 && s__state == 8592) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && (((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 0 == s__hit)) || (((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656)) && !(0 == s__hit))) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 8640)) || (8608 == s__state && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((s__state <= 8672 && 0 == blastFlag) && !(s__state == 8657)) && 8656 <= s__state)) || ((((blastFlag <= 3 && 8656 <= s__state) && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8640) && !(0 == s__hit))) || (s__s3__tmp__next_state___0 <= 8576 && (((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && 8656 <= s__state) && !(s__state == 8656))) || ((((((((8448 <= s__state && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8640) && 8640 <= s__state)) || (((((((((0 == blastFlag && 8448 <= s__state) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576)) || ((0 == blastFlag && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8528) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640) && 8608 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 8560 == s__state)) || ((blastFlag <= 2 && s__state == 8512) && 0 == s__hit)) || (s__state == 8592 && ((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (((blastFlag <= 2 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag <= 2 && 8656 <= s__state) && s__state <= 8656) && !(0 == s__hit))) || (s__state == 8592 && (((blastFlag == 1 && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && s__state <= 8640)) || (blastFlag <= 2 && s__state <= 3)) || (((s__state <= 8672 && !(s__state == 8657)) && 8656 <= s__state) && blastFlag == 1)) || ((((8640 <= s__s3__tmp__next_state___0 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 1) && s__state <= 8576)) || ((s__s3__tmp__next_state___0 <= 8576 && 0 == blastFlag) && s__state <= 8576)) || ((((blastFlag <= 3 && 8448 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 3) && s__state <= 8448)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8640) && 8640 <= s__state)) || ((blastFlag <= 2 && s__state == 8544) && 0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && s__state <= 8640) && 8640 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__state <= 8576 && ((((!(s__state == 8560) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) || (((((((blastFlag <= 2 && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) && 0 == s__hit)) || ((((((0 == blastFlag && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && 8512 <= s__state) && !(s__state == 8544)) && s__state <= 8576) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((s__s3__tmp__next_state___0 <= 8576 && 8608 == s__state) && blastFlag <= 2) && 0 == s__hit) || (0 == blastFlag && 8608 == s__state)) || (8608 == s__state && blastFlag == 1) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((0 == blastFlag && 8448 <= s__state) && !(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)) && s__state <= 8576)) || (((((((((((8448 <= s__state && !(s__state == 8560)) && blastFlag == 1) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && s__state <= 8576) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: SAFE, OverallTime: 33.0s, OverallIterations: 39, TraceHistogramMax: 24, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.1s, HoareTripleCheckerStatistics: 7340 SDtfs, 4454 SDslu, 3443 SDs, 0 SdLazy, 3925 SolverSat, 1034 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3099 GetRequests, 3043 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5034occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 6479 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 260 NumberOfFragments, 2709 HoareAnnotationTreeSize, 28 FomulaSimplifications, 258012 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 105745 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 11530 NumberOfCodeBlocks, 11530 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 11483 ConstructedInterpolants, 0 QuantifiedInterpolants, 5269159 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4812 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 47 InterpolantComputations, 35 PerfectInterpolantSequences, 44574/44754 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...