./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 49452e318e3c9c4b1e038ab7778998d33b04e5b2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:11,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:11,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:11,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:11,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:11,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:11,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:11,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:11,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:11,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:11,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:11,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:11,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:11,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:11,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:11,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:11,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:11,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:11,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:11,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:11,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:11,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:11,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:11,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:11,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:11,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:11,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:11,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:11,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:11,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:11,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:11,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:11,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:11,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:11,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:11,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:11,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:11,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:11,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:11,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:11,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:11,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:11,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:11,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:11,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:11,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:11,999 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:11,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:12,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:12,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:12,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:12,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:12,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:12,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:12,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:12,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:12,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:12,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:12,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:12,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:12,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:12,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:12,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:12,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:12,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:12,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:12,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:12,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:12,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:12,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:12,006 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 49452e318e3c9c4b1e038ab7778998d33b04e5b2 [2019-11-27 22:34:12,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:12,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:12,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:12,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:12,322 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:12,322 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-27 22:34:12,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ebd06f9/1561fcf3135d421996c0999b2da274cb/FLAG1d11d29ff [2019-11-27 22:34:12,884 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:12,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2019-11-27 22:34:12,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ebd06f9/1561fcf3135d421996c0999b2da274cb/FLAG1d11d29ff [2019-11-27 22:34:13,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0ebd06f9/1561fcf3135d421996c0999b2da274cb [2019-11-27 22:34:13,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:13,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:13,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:13,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:13,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:13,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee01756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13, skipping insertion in model container [2019-11-27 22:34:13,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:13,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:13,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:13,649 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:13,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:13,727 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:13,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13 WrapperNode [2019-11-27 22:34:13,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:13,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:13,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:13,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:13,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:13,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:13,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:13,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:13,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... [2019-11-27 22:34:13,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:13,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:13,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:13,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:13,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 22:34:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:13,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:14,054 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:14,653 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:34:14,655 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:34:14,659 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:14,661 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:14,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:14 BoogieIcfgContainer [2019-11-27 22:34:14,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:14,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:14,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:14,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:14,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:13" (1/3) ... [2019-11-27 22:34:14,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acdb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:14, skipping insertion in model container [2019-11-27 22:34:14,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:13" (2/3) ... [2019-11-27 22:34:14,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64acdb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:14, skipping insertion in model container [2019-11-27 22:34:14,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:14" (3/3) ... [2019-11-27 22:34:14,677 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2019-11-27 22:34:14,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:14,697 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:14,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:14,750 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:14,750 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:14,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:14,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:14,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:14,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:14,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:14,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-27 22:34:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:34:14,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:14,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:14,793 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash -91611738, now seen corresponding path program 1 times [2019-11-27 22:34:14,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:14,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239836677] [2019-11-27 22:34:14,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:15,099 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-27 22:34:15,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239836677] [2019-11-27 22:34:15,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:15,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958779809] [2019-11-27 22:34:15,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:15,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:15,135 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 3 states. [2019-11-27 22:34:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:15,456 INFO L93 Difference]: Finished difference Result 327 states and 564 transitions. [2019-11-27 22:34:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:15,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:34:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:15,474 INFO L225 Difference]: With dead ends: 327 [2019-11-27 22:34:15,474 INFO L226 Difference]: Without dead ends: 173 [2019-11-27 22:34:15,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-27 22:34:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2019-11-27 22:34:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-27 22:34:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 273 transitions. [2019-11-27 22:34:15,543 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 273 transitions. Word has length 43 [2019-11-27 22:34:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:15,544 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 273 transitions. [2019-11-27 22:34:15,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 273 transitions. [2019-11-27 22:34:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:34:15,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:15,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:15,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1448027309, now seen corresponding path program 1 times [2019-11-27 22:34:15,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:15,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609643950] [2019-11-27 22:34:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:15,670 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-27 22:34:15,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609643950] [2019-11-27 22:34:15,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:15,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402858165] [2019-11-27 22:34:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:15,676 INFO L87 Difference]: Start difference. First operand 167 states and 273 transitions. Second operand 3 states. [2019-11-27 22:34:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:15,918 INFO L93 Difference]: Finished difference Result 376 states and 623 transitions. [2019-11-27 22:34:15,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:15,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:34:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:15,922 INFO L225 Difference]: With dead ends: 376 [2019-11-27 22:34:15,922 INFO L226 Difference]: Without dead ends: 214 [2019-11-27 22:34:15,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-27 22:34:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2019-11-27 22:34:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-27 22:34:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 350 transitions. [2019-11-27 22:34:15,951 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 350 transitions. Word has length 44 [2019-11-27 22:34:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:15,951 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 350 transitions. [2019-11-27 22:34:15,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 350 transitions. [2019-11-27 22:34:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-27 22:34:15,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:15,957 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:15,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1909160843, now seen corresponding path program 1 times [2019-11-27 22:34:15,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:15,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364469105] [2019-11-27 22:34:15,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:16,036 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-27 22:34:16,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364469105] [2019-11-27 22:34:16,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:16,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:16,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096575876] [2019-11-27 22:34:16,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:16,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,042 INFO L87 Difference]: Start difference. First operand 208 states and 350 transitions. Second operand 3 states. [2019-11-27 22:34:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:16,282 INFO L93 Difference]: Finished difference Result 440 states and 747 transitions. [2019-11-27 22:34:16,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:16,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-27 22:34:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:16,285 INFO L225 Difference]: With dead ends: 440 [2019-11-27 22:34:16,286 INFO L226 Difference]: Without dead ends: 239 [2019-11-27 22:34:16,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-27 22:34:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-11-27 22:34:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-27 22:34:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 406 transitions. [2019-11-27 22:34:16,303 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 406 transitions. Word has length 72 [2019-11-27 22:34:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:16,304 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 406 transitions. [2019-11-27 22:34:16,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 406 transitions. [2019-11-27 22:34:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:34:16,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:16,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:16,312 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1091248829, now seen corresponding path program 1 times [2019-11-27 22:34:16,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:16,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982610082] [2019-11-27 22:34:16,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:16,442 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-27 22:34:16,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982610082] [2019-11-27 22:34:16,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:16,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:16,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160696270] [2019-11-27 22:34:16,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:16,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:16,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,446 INFO L87 Difference]: Start difference. First operand 239 states and 406 transitions. Second operand 3 states. [2019-11-27 22:34:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:16,693 INFO L93 Difference]: Finished difference Result 517 states and 883 transitions. [2019-11-27 22:34:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:16,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:34:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:16,696 INFO L225 Difference]: With dead ends: 517 [2019-11-27 22:34:16,699 INFO L226 Difference]: Without dead ends: 285 [2019-11-27 22:34:16,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-27 22:34:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-27 22:34:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-27 22:34:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 481 transitions. [2019-11-27 22:34:16,712 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 481 transitions. Word has length 83 [2019-11-27 22:34:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:16,712 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 481 transitions. [2019-11-27 22:34:16,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 481 transitions. [2019-11-27 22:34:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:16,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:16,716 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:16,716 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 448380383, now seen corresponding path program 1 times [2019-11-27 22:34:16,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:16,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896981181] [2019-11-27 22:34:16,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:16,754 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-27 22:34:16,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896981181] [2019-11-27 22:34:16,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:16,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:16,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632379372] [2019-11-27 22:34:16,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:16,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,757 INFO L87 Difference]: Start difference. First operand 281 states and 481 transitions. Second operand 3 states. [2019-11-27 22:34:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:16,932 INFO L93 Difference]: Finished difference Result 572 states and 979 transitions. [2019-11-27 22:34:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:16,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:16,936 INFO L225 Difference]: With dead ends: 572 [2019-11-27 22:34:16,936 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:34:16,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:34:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-27 22:34:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-27 22:34:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 503 transitions. [2019-11-27 22:34:16,951 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 503 transitions. Word has length 84 [2019-11-27 22:34:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:16,951 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 503 transitions. [2019-11-27 22:34:16,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 503 transitions. [2019-11-27 22:34:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:16,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:16,954 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:16,954 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 429685604, now seen corresponding path program 1 times [2019-11-27 22:34:16,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:16,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530747231] [2019-11-27 22:34:16,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,036 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-27 22:34:17,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530747231] [2019-11-27 22:34:17,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:17,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244896769] [2019-11-27 22:34:17,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,039 INFO L87 Difference]: Start difference. First operand 296 states and 503 transitions. Second operand 3 states. [2019-11-27 22:34:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:17,219 INFO L93 Difference]: Finished difference Result 589 states and 1000 transitions. [2019-11-27 22:34:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:17,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:17,222 INFO L225 Difference]: With dead ends: 589 [2019-11-27 22:34:17,222 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:34:17,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:34:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-27 22:34:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-11-27 22:34:17,234 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-11-27 22:34:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:17,234 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-11-27 22:34:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-11-27 22:34:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-27 22:34:17,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:17,236 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:17,237 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:17,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash -52731309, now seen corresponding path program 1 times [2019-11-27 22:34:17,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:17,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558220254] [2019-11-27 22:34:17,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,270 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-27 22:34:17,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558220254] [2019-11-27 22:34:17,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:17,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915922256] [2019-11-27 22:34:17,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:17,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:17,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,274 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 3 states. [2019-11-27 22:34:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:17,425 INFO L93 Difference]: Finished difference Result 583 states and 987 transitions. [2019-11-27 22:34:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:17,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-27 22:34:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:17,428 INFO L225 Difference]: With dead ends: 583 [2019-11-27 22:34:17,428 INFO L226 Difference]: Without dead ends: 296 [2019-11-27 22:34:17,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-27 22:34:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-27 22:34:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-27 22:34:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 494 transitions. [2019-11-27 22:34:17,444 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 494 transitions. Word has length 85 [2019-11-27 22:34:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 494 transitions. [2019-11-27 22:34:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 494 transitions. [2019-11-27 22:34:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-27 22:34:17,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:17,447 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:17,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash -825774373, now seen corresponding path program 1 times [2019-11-27 22:34:17,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:17,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945472847] [2019-11-27 22:34:17,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,510 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-27 22:34:17,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945472847] [2019-11-27 22:34:17,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:17,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93901251] [2019-11-27 22:34:17,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:17,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,513 INFO L87 Difference]: Start difference. First operand 294 states and 494 transitions. Second operand 3 states. [2019-11-27 22:34:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:17,632 INFO L93 Difference]: Finished difference Result 589 states and 988 transitions. [2019-11-27 22:34:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:17,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-27 22:34:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:17,634 INFO L225 Difference]: With dead ends: 589 [2019-11-27 22:34:17,636 INFO L226 Difference]: Without dead ends: 302 [2019-11-27 22:34:17,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-27 22:34:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-11-27 22:34:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-27 22:34:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 499 transitions. [2019-11-27 22:34:17,654 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 499 transitions. Word has length 97 [2019-11-27 22:34:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:17,654 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 499 transitions. [2019-11-27 22:34:17,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 499 transitions. [2019-11-27 22:34:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:34:17,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:17,663 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:17,663 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1871019140, now seen corresponding path program 1 times [2019-11-27 22:34:17,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:17,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710878085] [2019-11-27 22:34:17,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,728 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-27 22:34:17,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710878085] [2019-11-27 22:34:17,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30273545] [2019-11-27 22:34:17,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:17,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,731 INFO L87 Difference]: Start difference. First operand 302 states and 499 transitions. Second operand 3 states. [2019-11-27 22:34:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:17,889 INFO L93 Difference]: Finished difference Result 628 states and 1040 transitions. [2019-11-27 22:34:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:17,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-27 22:34:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:17,892 INFO L225 Difference]: With dead ends: 628 [2019-11-27 22:34:17,892 INFO L226 Difference]: Without dead ends: 333 [2019-11-27 22:34:17,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-27 22:34:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-11-27 22:34:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-27 22:34:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 546 transitions. [2019-11-27 22:34:17,906 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 546 transitions. Word has length 98 [2019-11-27 22:34:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:17,907 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 546 transitions. [2019-11-27 22:34:17,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 546 transitions. [2019-11-27 22:34:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:34:17,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:17,909 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:17,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1449457736, now seen corresponding path program 1 times [2019-11-27 22:34:17,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:17,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642931127] [2019-11-27 22:34:17,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,943 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-27 22:34:17,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642931127] [2019-11-27 22:34:17,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:17,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385217377] [2019-11-27 22:34:17,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:17,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:17,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:17,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:17,946 INFO L87 Difference]: Start difference. First operand 331 states and 546 transitions. Second operand 3 states. [2019-11-27 22:34:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:18,084 INFO L93 Difference]: Finished difference Result 689 states and 1140 transitions. [2019-11-27 22:34:18,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:18,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:34:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:18,088 INFO L225 Difference]: With dead ends: 689 [2019-11-27 22:34:18,088 INFO L226 Difference]: Without dead ends: 365 [2019-11-27 22:34:18,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-27 22:34:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-27 22:34:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-27 22:34:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 588 transitions. [2019-11-27 22:34:18,104 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 588 transitions. Word has length 99 [2019-11-27 22:34:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:18,104 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 588 transitions. [2019-11-27 22:34:18,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 588 transitions. [2019-11-27 22:34:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:34:18,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:18,107 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:18,107 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1215142768, now seen corresponding path program 1 times [2019-11-27 22:34:18,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:18,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126671076] [2019-11-27 22:34:18,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:18,145 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-27 22:34:18,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126671076] [2019-11-27 22:34:18,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:18,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773729780] [2019-11-27 22:34:18,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:18,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,148 INFO L87 Difference]: Start difference. First operand 358 states and 588 transitions. Second operand 3 states. [2019-11-27 22:34:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:18,301 INFO L93 Difference]: Finished difference Result 711 states and 1167 transitions. [2019-11-27 22:34:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:18,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:34:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:18,304 INFO L225 Difference]: With dead ends: 711 [2019-11-27 22:34:18,304 INFO L226 Difference]: Without dead ends: 360 [2019-11-27 22:34:18,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-27 22:34:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2019-11-27 22:34:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-27 22:34:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-11-27 22:34:18,321 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 99 [2019-11-27 22:34:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-11-27 22:34:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-11-27 22:34:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:34:18,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:18,324 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:18,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash -32577404, now seen corresponding path program 1 times [2019-11-27 22:34:18,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:18,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791939948] [2019-11-27 22:34:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:18,366 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-27 22:34:18,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791939948] [2019-11-27 22:34:18,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:18,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:18,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273886016] [2019-11-27 22:34:18,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:18,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,369 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-11-27 22:34:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:18,526 INFO L93 Difference]: Finished difference Result 716 states and 1169 transitions. [2019-11-27 22:34:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:18,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:34:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:18,529 INFO L225 Difference]: With dead ends: 716 [2019-11-27 22:34:18,529 INFO L226 Difference]: Without dead ends: 365 [2019-11-27 22:34:18,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-27 22:34:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 358. [2019-11-27 22:34:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-27 22:34:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 579 transitions. [2019-11-27 22:34:18,546 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 579 transitions. Word has length 100 [2019-11-27 22:34:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:18,547 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 579 transitions. [2019-11-27 22:34:18,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 579 transitions. [2019-11-27 22:34:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-27 22:34:18,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:18,549 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:18,550 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1057958359, now seen corresponding path program 1 times [2019-11-27 22:34:18,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:18,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561595333] [2019-11-27 22:34:18,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:18,598 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-27 22:34:18,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561595333] [2019-11-27 22:34:18,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:18,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:18,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934663249] [2019-11-27 22:34:18,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:18,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,602 INFO L87 Difference]: Start difference. First operand 358 states and 579 transitions. Second operand 3 states. [2019-11-27 22:34:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:18,730 INFO L93 Difference]: Finished difference Result 734 states and 1188 transitions. [2019-11-27 22:34:18,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:18,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-27 22:34:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:18,733 INFO L225 Difference]: With dead ends: 734 [2019-11-27 22:34:18,733 INFO L226 Difference]: Without dead ends: 383 [2019-11-27 22:34:18,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-27 22:34:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-27 22:34:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-27 22:34:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 608 transitions. [2019-11-27 22:34:18,766 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 608 transitions. Word has length 104 [2019-11-27 22:34:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:18,766 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 608 transitions. [2019-11-27 22:34:18,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 608 transitions. [2019-11-27 22:34:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:34:18,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:18,769 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:18,769 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash -278357315, now seen corresponding path program 1 times [2019-11-27 22:34:18,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:18,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056681781] [2019-11-27 22:34:18,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:18,797 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-27 22:34:18,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056681781] [2019-11-27 22:34:18,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:18,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:18,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087228061] [2019-11-27 22:34:18,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:18,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,801 INFO L87 Difference]: Start difference. First operand 379 states and 608 transitions. Second operand 3 states. [2019-11-27 22:34:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:18,931 INFO L93 Difference]: Finished difference Result 755 states and 1211 transitions. [2019-11-27 22:34:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:18,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:34:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:18,934 INFO L225 Difference]: With dead ends: 755 [2019-11-27 22:34:18,934 INFO L226 Difference]: Without dead ends: 383 [2019-11-27 22:34:18,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-27 22:34:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-11-27 22:34:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-27 22:34:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2019-11-27 22:34:18,951 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 105 [2019-11-27 22:34:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:18,952 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2019-11-27 22:34:18,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2019-11-27 22:34:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:34:18,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:18,955 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:18,955 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash 138382894, now seen corresponding path program 1 times [2019-11-27 22:34:18,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:18,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877232062] [2019-11-27 22:34:18,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:18,996 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-27 22:34:18,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877232062] [2019-11-27 22:34:18,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:18,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:18,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120178578] [2019-11-27 22:34:18,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:18,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:18,998 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand 3 states. [2019-11-27 22:34:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:19,050 INFO L93 Difference]: Finished difference Result 1117 states and 1778 transitions. [2019-11-27 22:34:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:19,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:34:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:19,056 INFO L225 Difference]: With dead ends: 1117 [2019-11-27 22:34:19,056 INFO L226 Difference]: Without dead ends: 745 [2019-11-27 22:34:19,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-27 22:34:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-27 22:34:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-27 22:34:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1181 transitions. [2019-11-27 22:34:19,087 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1181 transitions. Word has length 120 [2019-11-27 22:34:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:19,088 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1181 transitions. [2019-11-27 22:34:19,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1181 transitions. [2019-11-27 22:34:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 22:34:19,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:19,092 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:19,092 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2017513840, now seen corresponding path program 1 times [2019-11-27 22:34:19,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:19,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663131421] [2019-11-27 22:34:19,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:19,149 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-27 22:34:19,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663131421] [2019-11-27 22:34:19,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:19,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:19,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896396270] [2019-11-27 22:34:19,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:19,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,154 INFO L87 Difference]: Start difference. First operand 745 states and 1181 transitions. Second operand 3 states. [2019-11-27 22:34:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:19,210 INFO L93 Difference]: Finished difference Result 1117 states and 1772 transitions. [2019-11-27 22:34:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:19,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 22:34:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:19,217 INFO L225 Difference]: With dead ends: 1117 [2019-11-27 22:34:19,217 INFO L226 Difference]: Without dead ends: 1115 [2019-11-27 22:34:19,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-11-27 22:34:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2019-11-27 22:34:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-27 22:34:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1769 transitions. [2019-11-27 22:34:19,257 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1769 transitions. Word has length 120 [2019-11-27 22:34:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:19,258 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1769 transitions. [2019-11-27 22:34:19,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1769 transitions. [2019-11-27 22:34:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-27 22:34:19,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:19,262 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:19,263 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -888705079, now seen corresponding path program 1 times [2019-11-27 22:34:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349525501] [2019-11-27 22:34:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:19,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349525501] [2019-11-27 22:34:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:19,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:19,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295513473] [2019-11-27 22:34:19,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:19,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,314 INFO L87 Difference]: Start difference. First operand 1115 states and 1769 transitions. Second operand 3 states. [2019-11-27 22:34:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:19,616 INFO L93 Difference]: Finished difference Result 2349 states and 3730 transitions. [2019-11-27 22:34:19,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:19,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-27 22:34:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:19,623 INFO L225 Difference]: With dead ends: 2349 [2019-11-27 22:34:19,623 INFO L226 Difference]: Without dead ends: 1241 [2019-11-27 22:34:19,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-27 22:34:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1229. [2019-11-27 22:34:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-11-27 22:34:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1946 transitions. [2019-11-27 22:34:19,670 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1946 transitions. Word has length 121 [2019-11-27 22:34:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:19,670 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1946 transitions. [2019-11-27 22:34:19,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1946 transitions. [2019-11-27 22:34:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-27 22:34:19,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:19,674 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:34:19,675 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash 601692112, now seen corresponding path program 1 times [2019-11-27 22:34:19,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:19,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224985867] [2019-11-27 22:34:19,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:34:19,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224985867] [2019-11-27 22:34:19,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:19,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:19,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498107697] [2019-11-27 22:34:19,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:19,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,730 INFO L87 Difference]: Start difference. First operand 1229 states and 1946 transitions. Second operand 3 states. [2019-11-27 22:34:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:19,935 INFO L93 Difference]: Finished difference Result 2463 states and 3898 transitions. [2019-11-27 22:34:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:19,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-27 22:34:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:19,942 INFO L225 Difference]: With dead ends: 2463 [2019-11-27 22:34:19,943 INFO L226 Difference]: Without dead ends: 1235 [2019-11-27 22:34:19,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-11-27 22:34:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-11-27 22:34:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-11-27 22:34:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1928 transitions. [2019-11-27 22:34:19,983 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1928 transitions. Word has length 122 [2019-11-27 22:34:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:19,984 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1928 transitions. [2019-11-27 22:34:19,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1928 transitions. [2019-11-27 22:34:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-27 22:34:19,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:19,988 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:19,989 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504061, now seen corresponding path program 1 times [2019-11-27 22:34:19,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:19,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310589624] [2019-11-27 22:34:19,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-27 22:34:20,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310589624] [2019-11-27 22:34:20,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973227958] [2019-11-27 22:34:20,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,033 INFO L87 Difference]: Start difference. First operand 1223 states and 1928 transitions. Second operand 3 states. [2019-11-27 22:34:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:20,222 INFO L93 Difference]: Finished difference Result 2553 states and 4025 transitions. [2019-11-27 22:34:20,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:20,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-27 22:34:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:20,230 INFO L225 Difference]: With dead ends: 2553 [2019-11-27 22:34:20,230 INFO L226 Difference]: Without dead ends: 1337 [2019-11-27 22:34:20,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-27 22:34:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-11-27 22:34:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-11-27 22:34:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2090 transitions. [2019-11-27 22:34:20,284 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2090 transitions. Word has length 154 [2019-11-27 22:34:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:20,285 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 2090 transitions. [2019-11-27 22:34:20,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2090 transitions. [2019-11-27 22:34:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-27 22:34:20,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:20,290 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:20,291 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2116162422, now seen corresponding path program 1 times [2019-11-27 22:34:20,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:20,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866719201] [2019-11-27 22:34:20,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-27 22:34:20,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866719201] [2019-11-27 22:34:20,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19814421] [2019-11-27 22:34:20,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,354 INFO L87 Difference]: Start difference. First operand 1331 states and 2090 transitions. Second operand 3 states. [2019-11-27 22:34:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:20,634 INFO L93 Difference]: Finished difference Result 2661 states and 4175 transitions. [2019-11-27 22:34:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:20,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-27 22:34:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:20,645 INFO L225 Difference]: With dead ends: 2661 [2019-11-27 22:34:20,645 INFO L226 Difference]: Without dead ends: 1331 [2019-11-27 22:34:20,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-11-27 22:34:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1325. [2019-11-27 22:34:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-11-27 22:34:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2069 transitions. [2019-11-27 22:34:20,706 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2069 transitions. Word has length 155 [2019-11-27 22:34:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:20,707 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 2069 transitions. [2019-11-27 22:34:20,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2069 transitions. [2019-11-27 22:34:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-27 22:34:20,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:20,715 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:20,715 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:20,716 INFO L82 PathProgramCache]: Analyzing trace with hash 926552750, now seen corresponding path program 1 times [2019-11-27 22:34:20,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:20,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272969947] [2019-11-27 22:34:20,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-27 22:34:20,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272969947] [2019-11-27 22:34:20,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:20,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:20,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783596417] [2019-11-27 22:34:20,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:20,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:20,827 INFO L87 Difference]: Start difference. First operand 1325 states and 2069 transitions. Second operand 3 states. [2019-11-27 22:34:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,029 INFO L93 Difference]: Finished difference Result 2751 states and 4295 transitions. [2019-11-27 22:34:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-27 22:34:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,037 INFO L225 Difference]: With dead ends: 2751 [2019-11-27 22:34:21,037 INFO L226 Difference]: Without dead ends: 1433 [2019-11-27 22:34:21,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-11-27 22:34:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1427. [2019-11-27 22:34:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-11-27 22:34:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2216 transitions. [2019-11-27 22:34:21,090 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2216 transitions. Word has length 185 [2019-11-27 22:34:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,091 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 2216 transitions. [2019-11-27 22:34:21,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2216 transitions. [2019-11-27 22:34:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-27 22:34:21,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,096 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,097 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 405410805, now seen corresponding path program 1 times [2019-11-27 22:34:21,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348537479] [2019-11-27 22:34:21,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-27 22:34:21,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348537479] [2019-11-27 22:34:21,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307151373] [2019-11-27 22:34:21,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,160 INFO L87 Difference]: Start difference. First operand 1427 states and 2216 transitions. Second operand 3 states. [2019-11-27 22:34:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,364 INFO L93 Difference]: Finished difference Result 2853 states and 4427 transitions. [2019-11-27 22:34:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-27 22:34:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,375 INFO L225 Difference]: With dead ends: 2853 [2019-11-27 22:34:21,375 INFO L226 Difference]: Without dead ends: 1427 [2019-11-27 22:34:21,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-11-27 22:34:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1421. [2019-11-27 22:34:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-11-27 22:34:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2192 transitions. [2019-11-27 22:34:21,445 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2192 transitions. Word has length 186 [2019-11-27 22:34:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,445 INFO L462 AbstractCegarLoop]: Abstraction has 1421 states and 2192 transitions. [2019-11-27 22:34:21,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2192 transitions. [2019-11-27 22:34:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-27 22:34:21,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,453 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,454 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 311594383, now seen corresponding path program 1 times [2019-11-27 22:34:21,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622537496] [2019-11-27 22:34:21,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-27 22:34:21,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622537496] [2019-11-27 22:34:21,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836792361] [2019-11-27 22:34:21,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,567 INFO L87 Difference]: Start difference. First operand 1421 states and 2192 transitions. Second operand 3 states. [2019-11-27 22:34:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:21,750 INFO L93 Difference]: Finished difference Result 2946 states and 4556 transitions. [2019-11-27 22:34:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:21,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-27 22:34:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:21,761 INFO L225 Difference]: With dead ends: 2946 [2019-11-27 22:34:21,762 INFO L226 Difference]: Without dead ends: 1532 [2019-11-27 22:34:21,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-27 22:34:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-27 22:34:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-27 22:34:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2288 transitions. [2019-11-27 22:34:21,831 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2288 transitions. Word has length 203 [2019-11-27 22:34:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:21,832 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2288 transitions. [2019-11-27 22:34:21,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2288 transitions. [2019-11-27 22:34:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-27 22:34:21,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:21,840 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:21,841 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1374927291, now seen corresponding path program 1 times [2019-11-27 22:34:21,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:21,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877755213] [2019-11-27 22:34:21,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-27 22:34:21,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877755213] [2019-11-27 22:34:21,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:21,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:21,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582547762] [2019-11-27 22:34:21,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:21,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:21,934 INFO L87 Difference]: Start difference. First operand 1496 states and 2288 transitions. Second operand 3 states. [2019-11-27 22:34:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,135 INFO L93 Difference]: Finished difference Result 3021 states and 4625 transitions. [2019-11-27 22:34:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-27 22:34:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,144 INFO L225 Difference]: With dead ends: 3021 [2019-11-27 22:34:22,144 INFO L226 Difference]: Without dead ends: 1532 [2019-11-27 22:34:22,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-11-27 22:34:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1496. [2019-11-27 22:34:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-27 22:34:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2261 transitions. [2019-11-27 22:34:22,201 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2261 transitions. Word has length 204 [2019-11-27 22:34:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,202 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2261 transitions. [2019-11-27 22:34:22,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2261 transitions. [2019-11-27 22:34:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-27 22:34:22,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,208 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,208 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1705472573, now seen corresponding path program 1 times [2019-11-27 22:34:22,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380301363] [2019-11-27 22:34:22,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-27 22:34:22,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380301363] [2019-11-27 22:34:22,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787704980] [2019-11-27 22:34:22,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,282 INFO L87 Difference]: Start difference. First operand 1496 states and 2261 transitions. Second operand 3 states. [2019-11-27 22:34:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,498 INFO L93 Difference]: Finished difference Result 2997 states and 4526 transitions. [2019-11-27 22:34:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-27 22:34:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,507 INFO L225 Difference]: With dead ends: 2997 [2019-11-27 22:34:22,507 INFO L226 Difference]: Without dead ends: 1508 [2019-11-27 22:34:22,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-11-27 22:34:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1496. [2019-11-27 22:34:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-27 22:34:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2243 transitions. [2019-11-27 22:34:22,564 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2243 transitions. Word has length 216 [2019-11-27 22:34:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,565 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2243 transitions. [2019-11-27 22:34:22,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2243 transitions. [2019-11-27 22:34:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-27 22:34:22,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,571 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,571 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2105710730, now seen corresponding path program 1 times [2019-11-27 22:34:22,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129440890] [2019-11-27 22:34:22,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-27 22:34:22,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129440890] [2019-11-27 22:34:22,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576665966] [2019-11-27 22:34:22,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,639 INFO L87 Difference]: Start difference. First operand 1496 states and 2243 transitions. Second operand 3 states. [2019-11-27 22:34:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:22,848 INFO L93 Difference]: Finished difference Result 2997 states and 4490 transitions. [2019-11-27 22:34:22,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:22,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-27 22:34:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:22,856 INFO L225 Difference]: With dead ends: 2997 [2019-11-27 22:34:22,856 INFO L226 Difference]: Without dead ends: 1481 [2019-11-27 22:34:22,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-27 22:34:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1469. [2019-11-27 22:34:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-11-27 22:34:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2186 transitions. [2019-11-27 22:34:22,905 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2186 transitions. Word has length 217 [2019-11-27 22:34:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:22,905 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2186 transitions. [2019-11-27 22:34:22,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2186 transitions. [2019-11-27 22:34:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-27 22:34:22,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:22,911 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:22,912 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash 721369725, now seen corresponding path program 1 times [2019-11-27 22:34:22,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:22,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190417007] [2019-11-27 22:34:22,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-27 22:34:22,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190417007] [2019-11-27 22:34:22,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:22,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:22,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402429666] [2019-11-27 22:34:22,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:22,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:22,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:22,972 INFO L87 Difference]: Start difference. First operand 1469 states and 2186 transitions. Second operand 3 states. [2019-11-27 22:34:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,164 INFO L93 Difference]: Finished difference Result 2986 states and 4447 transitions. [2019-11-27 22:34:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-27 22:34:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,173 INFO L225 Difference]: With dead ends: 2986 [2019-11-27 22:34:23,174 INFO L226 Difference]: Without dead ends: 1524 [2019-11-27 22:34:23,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2019-11-27 22:34:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1515. [2019-11-27 22:34:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-11-27 22:34:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2230 transitions. [2019-11-27 22:34:23,238 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2230 transitions. Word has length 223 [2019-11-27 22:34:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,239 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 2230 transitions. [2019-11-27 22:34:23,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2230 transitions. [2019-11-27 22:34:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-27 22:34:23,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,248 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,249 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 194394121, now seen corresponding path program 1 times [2019-11-27 22:34:23,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340612489] [2019-11-27 22:34:23,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-27 22:34:23,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340612489] [2019-11-27 22:34:23,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:23,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681092330] [2019-11-27 22:34:23,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:23,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,352 INFO L87 Difference]: Start difference. First operand 1515 states and 2230 transitions. Second operand 3 states. [2019-11-27 22:34:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:23,557 INFO L93 Difference]: Finished difference Result 2605 states and 3838 transitions. [2019-11-27 22:34:23,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:23,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-11-27 22:34:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:23,563 INFO L225 Difference]: With dead ends: 2605 [2019-11-27 22:34:23,564 INFO L226 Difference]: Without dead ends: 1085 [2019-11-27 22:34:23,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-11-27 22:34:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1079. [2019-11-27 22:34:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-27 22:34:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1573 transitions. [2019-11-27 22:34:23,611 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1573 transitions. Word has length 224 [2019-11-27 22:34:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:23,612 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1573 transitions. [2019-11-27 22:34:23,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1573 transitions. [2019-11-27 22:34:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-27 22:34:23,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,617 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,618 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1786104814, now seen corresponding path program 1 times [2019-11-27 22:34:23,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062261742] [2019-11-27 22:34:23,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-27 22:34:23,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062261742] [2019-11-27 22:34:23,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892597955] [2019-11-27 22:34:23,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 22:34:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:23,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-27 22:34:24,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:24,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:34:24,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680801148] [2019-11-27 22:34:24,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:24,043 INFO L87 Difference]: Start difference. First operand 1079 states and 1573 transitions. Second operand 3 states. [2019-11-27 22:34:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,129 INFO L93 Difference]: Finished difference Result 2658 states and 3873 transitions. [2019-11-27 22:34:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-27 22:34:24,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,152 INFO L225 Difference]: With dead ends: 2658 [2019-11-27 22:34:24,152 INFO L226 Difference]: Without dead ends: 1586 [2019-11-27 22:34:24,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 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-27 22:34:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-27 22:34:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2019-11-27 22:34:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-27 22:34:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2310 transitions. [2019-11-27 22:34:24,227 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2310 transitions. Word has length 260 [2019-11-27 22:34:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,228 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 2310 transitions. [2019-11-27 22:34:24,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2310 transitions. [2019-11-27 22:34:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-27 22:34:24,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,239 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:34:24,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:24,447 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1088106038, now seen corresponding path program 1 times [2019-11-27 22:34:24,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520398193] [2019-11-27 22:34:24,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-27 22:34:24,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520398193] [2019-11-27 22:34:24,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:24,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:24,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375522206] [2019-11-27 22:34:24,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:24,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:24,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,677 INFO L87 Difference]: Start difference. First operand 1586 states and 2310 transitions. Second operand 3 states. [2019-11-27 22:34:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:24,814 INFO L93 Difference]: Finished difference Result 4663 states and 6788 transitions. [2019-11-27 22:34:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:24,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-27 22:34:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:24,834 INFO L225 Difference]: With dead ends: 4663 [2019-11-27 22:34:24,835 INFO L226 Difference]: Without dead ends: 3084 [2019-11-27 22:34:24,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-11-27 22:34:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3082. [2019-11-27 22:34:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-11-27 22:34:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4479 transitions. [2019-11-27 22:34:24,978 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4479 transitions. Word has length 270 [2019-11-27 22:34:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:24,979 INFO L462 AbstractCegarLoop]: Abstraction has 3082 states and 4479 transitions. [2019-11-27 22:34:24,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4479 transitions. [2019-11-27 22:34:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-27 22:34:24,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:24,988 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:24,989 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash 420200473, now seen corresponding path program 1 times [2019-11-27 22:34:24,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:24,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435726842] [2019-11-27 22:34:24,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-27 22:34:25,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435726842] [2019-11-27 22:34:25,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:25,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740082119] [2019-11-27 22:34:25,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:25,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,142 INFO L87 Difference]: Start difference. First operand 3082 states and 4479 transitions. Second operand 3 states. [2019-11-27 22:34:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,383 INFO L93 Difference]: Finished difference Result 6317 states and 9203 transitions. [2019-11-27 22:34:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:25,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-27 22:34:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,389 INFO L225 Difference]: With dead ends: 6317 [2019-11-27 22:34:25,390 INFO L226 Difference]: Without dead ends: 2034 [2019-11-27 22:34:25,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-11-27 22:34:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2014. [2019-11-27 22:34:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-11-27 22:34:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2877 transitions. [2019-11-27 22:34:25,467 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2877 transitions. Word has length 307 [2019-11-27 22:34:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,467 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2877 transitions. [2019-11-27 22:34:25,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2877 transitions. [2019-11-27 22:34:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-11-27 22:34:25,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,476 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 22:34:25,477 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 982370538, now seen corresponding path program 1 times [2019-11-27 22:34:25,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181179462] [2019-11-27 22:34:25,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:25,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181179462] [2019-11-27 22:34:25,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480441975] [2019-11-27 22:34:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 22:34:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:25,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-27 22:34:26,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:26,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:26,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072222055] [2019-11-27 22:34:26,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:26,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:26,016 INFO L87 Difference]: Start difference. First operand 2014 states and 2877 transitions. Second operand 4 states. [2019-11-27 22:34:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,369 INFO L93 Difference]: Finished difference Result 4694 states and 6697 transitions. [2019-11-27 22:34:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:26,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2019-11-27 22:34:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,377 INFO L225 Difference]: With dead ends: 4694 [2019-11-27 22:34:26,377 INFO L226 Difference]: Without dead ends: 2643 [2019-11-27 22:34:26,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 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-27 22:34:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-11-27 22:34:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1989. [2019-11-27 22:34:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-27 22:34:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-27 22:34:26,461 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 372 [2019-11-27 22:34:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,462 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-27 22:34:26,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-27 22:34:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-27 22:34:26,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,480 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 22:34:26,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:26,684 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1689104854, now seen corresponding path program 1 times [2019-11-27 22:34:26,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927788773] [2019-11-27 22:34:26,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:27,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927788773] [2019-11-27 22:34:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795273227] [2019-11-27 22:34:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 22:34:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:27,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-27 22:34:27,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:27,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:34:27,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017750849] [2019-11-27 22:34:27,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:27,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:27,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:27,825 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 4 states. [2019-11-27 22:34:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:28,154 INFO L93 Difference]: Finished difference Result 4937 states and 6862 transitions. [2019-11-27 22:34:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:28,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-27 22:34:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:28,161 INFO L225 Difference]: With dead ends: 4937 [2019-11-27 22:34:28,161 INFO L226 Difference]: Without dead ends: 2814 [2019-11-27 22:34:28,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 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-27 22:34:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-11-27 22:34:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1989. [2019-11-27 22:34:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-27 22:34:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2753 transitions. [2019-11-27 22:34:28,238 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2753 transitions. Word has length 600 [2019-11-27 22:34:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:28,239 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2753 transitions. [2019-11-27 22:34:28,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2753 transitions. [2019-11-27 22:34:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-11-27 22:34:28,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:28,257 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:28,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:28,462 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1687662778, now seen corresponding path program 1 times [2019-11-27 22:34:28,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:28,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199412292] [2019-11-27 22:34:28,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-27 22:34:28,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199412292] [2019-11-27 22:34:28,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:28,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302027252] [2019-11-27 22:34:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:28,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:28,906 INFO L87 Difference]: Start difference. First operand 1989 states and 2753 transitions. Second operand 3 states. [2019-11-27 22:34:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:29,128 INFO L93 Difference]: Finished difference Result 4007 states and 5539 transitions. [2019-11-27 22:34:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:29,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-11-27 22:34:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:29,133 INFO L225 Difference]: With dead ends: 4007 [2019-11-27 22:34:29,133 INFO L226 Difference]: Without dead ends: 2025 [2019-11-27 22:34:29,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-11-27 22:34:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1989. [2019-11-27 22:34:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-27 22:34:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2733 transitions. [2019-11-27 22:34:29,207 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2733 transitions. Word has length 667 [2019-11-27 22:34:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:29,207 INFO L462 AbstractCegarLoop]: Abstraction has 1989 states and 2733 transitions. [2019-11-27 22:34:29,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2733 transitions. [2019-11-27 22:34:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-11-27 22:34:29,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:29,231 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 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, 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-27 22:34:29,231 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1182124796, now seen corresponding path program 1 times [2019-11-27 22:34:29,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:29,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111743777] [2019-11-27 22:34:29,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-27 22:34:29,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111743777] [2019-11-27 22:34:29,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439658788] [2019-11-27 22:34:29,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:29,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:29,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:29,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:29,791 INFO L87 Difference]: Start difference. First operand 1989 states and 2733 transitions. Second operand 3 states. [2019-11-27 22:34:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:30,001 INFO L93 Difference]: Finished difference Result 3986 states and 5473 transitions. [2019-11-27 22:34:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:30,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 681 [2019-11-27 22:34:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:30,006 INFO L225 Difference]: With dead ends: 3986 [2019-11-27 22:34:30,007 INFO L226 Difference]: Without dead ends: 2004 [2019-11-27 22:34:30,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-11-27 22:34:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1976. [2019-11-27 22:34:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2019-11-27 22:34:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2674 transitions. [2019-11-27 22:34:30,079 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2674 transitions. Word has length 681 [2019-11-27 22:34:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:30,080 INFO L462 AbstractCegarLoop]: Abstraction has 1976 states and 2674 transitions. [2019-11-27 22:34:30,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2674 transitions. [2019-11-27 22:34:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2019-11-27 22:34:30,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:30,104 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 22:34:30,104 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 8635284, now seen corresponding path program 1 times [2019-11-27 22:34:30,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:30,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64597447] [2019-11-27 22:34:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-27 22:34:30,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64597447] [2019-11-27 22:34:30,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:30,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:30,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347865755] [2019-11-27 22:34:30,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:30,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:30,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,446 INFO L87 Difference]: Start difference. First operand 1976 states and 2674 transitions. Second operand 3 states. [2019-11-27 22:34:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:30,631 INFO L93 Difference]: Finished difference Result 4014 states and 5435 transitions. [2019-11-27 22:34:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:30,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 710 [2019-11-27 22:34:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:30,636 INFO L225 Difference]: With dead ends: 4014 [2019-11-27 22:34:30,637 INFO L226 Difference]: Without dead ends: 2027 [2019-11-27 22:34:30,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-27 22:34:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2018. [2019-11-27 22:34:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-11-27 22:34:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2719 transitions. [2019-11-27 22:34:30,702 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2719 transitions. Word has length 710 [2019-11-27 22:34:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:30,703 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 2719 transitions. [2019-11-27 22:34:30,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2719 transitions. [2019-11-27 22:34:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2019-11-27 22:34:30,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:30,710 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 22:34:30,710 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1819983258, now seen corresponding path program 1 times [2019-11-27 22:34:30,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:30,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877107994] [2019-11-27 22:34:30,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-27 22:34:31,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877107994] [2019-11-27 22:34:31,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:31,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:31,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591195686] [2019-11-27 22:34:31,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:31,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,008 INFO L87 Difference]: Start difference. First operand 2018 states and 2719 transitions. Second operand 3 states. [2019-11-27 22:34:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:31,145 INFO L93 Difference]: Finished difference Result 2591 states and 3474 transitions. [2019-11-27 22:34:31,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:31,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 725 [2019-11-27 22:34:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:31,146 INFO L225 Difference]: With dead ends: 2591 [2019-11-27 22:34:31,147 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:31,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:31,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 725 [2019-11-27 22:34:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:31,152 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:31,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:31,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:31,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:31,997 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-27 22:34:32,312 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 126 [2019-11-27 22:34:32,720 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2019-11-27 22:34:33,167 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2019-11-27 22:34:33,579 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-27 22:34:33,964 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-27 22:34:34,291 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-27 22:34:34,637 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-27 22:34:34,978 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-11-27 22:34:35,259 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2019-11-27 22:34:35,691 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:34:36,113 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:34:36,517 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:34:36,928 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-11-27 22:34:37,399 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:34:37,825 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-11-27 22:34:38,527 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-27 22:34:38,859 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-27 22:34:39,192 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-11-27 22:34:39,497 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-27 22:34:39,872 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2019-11-27 22:34:40,555 WARN L192 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-27 22:34:40,558 INFO L246 CegarLoopResult]: For program point L630(lines 630 654) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L564(lines 564 568) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L498(lines 498 502) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L564-2(lines 564 568) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L498-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L201(lines 201 595) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L168(lines 168 606) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L135(lines 135 617) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L102(lines 102 628) no Hoare annotation was computed. [2019-11-27 22:34:40,559 INFO L246 CegarLoopResult]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-11-27 22:34:40,560 INFO L246 CegarLoopResult]: For program point L631(lines 631 640) no Hoare annotation was computed. [2019-11-27 22:34:40,560 INFO L246 CegarLoopResult]: For program point L664-2(lines 664 668) no Hoare annotation was computed. [2019-11-27 22:34:40,560 INFO L246 CegarLoopResult]: For program point L631-2(lines 630 652) no Hoare annotation was computed. [2019-11-27 22:34:40,560 INFO L246 CegarLoopResult]: For program point L268(lines 268 272) no Hoare annotation was computed. [2019-11-27 22:34:40,566 INFO L242 CegarLoopResult]: At program point L202(lines 198 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2019-11-27 22:34:40,566 INFO L242 CegarLoopResult]: At program point L103(lines 102 628) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L302-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L633(lines 633 637) no Hoare annotation was computed. [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L204(lines 204 594) no Hoare annotation was computed. [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L171(lines 171 605) no Hoare annotation was computed. [2019-11-27 22:34:40,567 INFO L246 CegarLoopResult]: For program point L138(lines 138 616) no Hoare annotation was computed. [2019-11-27 22:34:40,568 INFO L246 CegarLoopResult]: For program point L105(lines 105 627) no Hoare annotation was computed. [2019-11-27 22:34:40,568 INFO L246 CegarLoopResult]: For program point L337(lines 337 341) no Hoare annotation was computed. [2019-11-27 22:34:40,568 INFO L246 CegarLoopResult]: For program point L337-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,568 INFO L242 CegarLoopResult]: At program point L205(lines 204 594) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,569 INFO L242 CegarLoopResult]: At program point L172(lines 168 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse1 .cse2 .cse3 .cse9 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse5 .cse6 .cse7 .cse10 .cse11 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-27 22:34:40,569 INFO L242 CegarLoopResult]: At program point L139(lines 135 617) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,569 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,569 INFO L246 CegarLoopResult]: For program point L437(lines 437 449) no Hoare annotation was computed. [2019-11-27 22:34:40,570 INFO L242 CegarLoopResult]: At program point L404(lines 395 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,570 INFO L246 CegarLoopResult]: For program point L437-2(lines 437 449) no Hoare annotation was computed. [2019-11-27 22:34:40,570 INFO L246 CegarLoopResult]: For program point L174(lines 174 604) no Hoare annotation was computed. [2019-11-27 22:34:40,570 INFO L246 CegarLoopResult]: For program point L141(lines 141 615) no Hoare annotation was computed. [2019-11-27 22:34:40,570 INFO L246 CegarLoopResult]: For program point L108(lines 108 626) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L242 CegarLoopResult]: At program point L208(lines 207 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L440(lines 440 445) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L242(lines 242 247) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L177(lines 177 603) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L144(lines 144 614) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L111(lines 111 625) no Hoare annotation was computed. [2019-11-27 22:34:40,571 INFO L246 CegarLoopResult]: For program point L574(lines 574 584) no Hoare annotation was computed. [2019-11-27 22:34:40,572 INFO L246 CegarLoopResult]: For program point L574-1(lines 574 584) no Hoare annotation was computed. [2019-11-27 22:34:40,572 INFO L246 CegarLoopResult]: For program point L508(lines 508 512) no Hoare annotation was computed. [2019-11-27 22:34:40,572 INFO L246 CegarLoopResult]: For program point L508-2(lines 508 512) no Hoare annotation was computed. [2019-11-27 22:34:40,572 INFO L242 CegarLoopResult]: At program point L178(lines 174 604) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,572 INFO L242 CegarLoopResult]: At program point L145(lines 141 615) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.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 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,572 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L242 CegarLoopResult]: At program point L212(lines 105 627) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2019-11-27 22:34:40,573 INFO L249 CegarLoopResult]: At program point L675(lines 65 677) the Hoare annotation is: true [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L642(lines 642 648) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L345(lines 345 377) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L312(lines 312 316) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L312-2(lines 312 316) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L180(lines 180 602) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L147(lines 147 613) no Hoare annotation was computed. [2019-11-27 22:34:40,573 INFO L246 CegarLoopResult]: For program point L114(lines 114 624) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L249 CegarLoopResult]: At program point L676(lines 10 678) the Hoare annotation is: true [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L577(lines 577 581) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L83-1(lines 65 677) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L348(lines 348 376) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L348-1(lines 348 376) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L249(lines 249 262) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L183(lines 183 601) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L150(lines 150 612) no Hoare annotation was computed. [2019-11-27 22:34:40,574 INFO L246 CegarLoopResult]: For program point L117(lines 117 623) no Hoare annotation was computed. [2019-11-27 22:34:40,575 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-27 22:34:40,575 INFO L246 CegarLoopResult]: For program point L349(lines 349 373) no Hoare annotation was computed. [2019-11-27 22:34:40,575 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-27 22:34:40,575 INFO L242 CegarLoopResult]: At program point L184(lines 180 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,576 INFO L242 CegarLoopResult]: At program point L151(lines 147 613) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,576 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,576 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,576 INFO L246 CegarLoopResult]: For program point L251(lines 251 256) no Hoare annotation was computed. [2019-11-27 22:34:40,576 INFO L246 CegarLoopResult]: For program point L549(lines 549 557) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L285-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L186(lines 186 600) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L153(lines 153 611) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L120(lines 120 622) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L385(lines 385 416) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L352(lines 352 372) no Hoare annotation was computed. [2019-11-27 22:34:40,577 INFO L242 CegarLoopResult]: At program point L121(lines 117 623) the Hoare annotation is: (let ((.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse12 .cse13 .cse14 .cse15 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse11 .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse12 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse6 .cse7 .cse8 .cse13 .cse14 .cse9 .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-11-27 22:34:40,577 INFO L246 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L552(lines 552 556) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L519(lines 519 524) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L321-1(lines 321 330) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L354-2(lines 352 370) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L189(lines 189 599) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L156(lines 156 610) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L123(lines 123 621) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L242 CegarLoopResult]: At program point L553(lines 65 677) the Hoare annotation is: false [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-27 22:34:40,578 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,579 INFO L242 CegarLoopResult]: At program point L190(lines 186 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse18 .cse19 .cse20 .cse21))) [2019-11-27 22:34:40,579 INFO L242 CegarLoopResult]: At program point L157(lines 153 611) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,580 INFO L242 CegarLoopResult]: At program point L124(lines 123 621) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-27 22:34:40,580 INFO L246 CegarLoopResult]: For program point L455(lines 455 459) no Hoare annotation was computed. [2019-11-27 22:34:40,580 INFO L246 CegarLoopResult]: For program point L192(lines 192 598) no Hoare annotation was computed. [2019-11-27 22:34:40,580 INFO L246 CegarLoopResult]: For program point L159(lines 159 609) no Hoare annotation was computed. [2019-11-27 22:34:40,580 INFO L246 CegarLoopResult]: For program point L126(lines 126 620) no Hoare annotation was computed. [2019-11-27 22:34:40,580 INFO L249 CegarLoopResult]: At program point L688(lines 679 690) the Hoare annotation is: true [2019-11-27 22:34:40,581 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-11-27 22:34:40,581 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:40,581 INFO L242 CegarLoopResult]: At program point L591(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-11-27 22:34:40,581 INFO L246 CegarLoopResult]: For program point L558(lines 558 562) no Hoare annotation was computed. [2019-11-27 22:34:40,582 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-27 22:34:40,582 INFO L242 CegarLoopResult]: At program point L360(lines 342 378) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,582 INFO L246 CegarLoopResult]: For program point L195(lines 195 597) no Hoare annotation was computed. [2019-11-27 22:34:40,582 INFO L246 CegarLoopResult]: For program point L162(lines 162 608) no Hoare annotation was computed. [2019-11-27 22:34:40,582 INFO L246 CegarLoopResult]: For program point L129(lines 129 619) no Hoare annotation was computed. [2019-11-27 22:34:40,583 INFO L246 CegarLoopResult]: For program point L526(lines 526 530) no Hoare annotation was computed. [2019-11-27 22:34:40,583 INFO L246 CegarLoopResult]: For program point L460(lines 460 471) no Hoare annotation was computed. [2019-11-27 22:34:40,583 INFO L246 CegarLoopResult]: For program point L526-2(lines 209 590) no Hoare annotation was computed. [2019-11-27 22:34:40,583 INFO L242 CegarLoopResult]: At program point L394(lines 385 416) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 .cse9 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,583 INFO L246 CegarLoopResult]: For program point L229(lines 229 240) no Hoare annotation was computed. [2019-11-27 22:34:40,584 INFO L242 CegarLoopResult]: At program point L196(lines 192 598) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse19 .cse20 .cse21) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,584 INFO L242 CegarLoopResult]: At program point L163(lines 159 609) the Hoare annotation is: (let ((.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse11 .cse0 .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8 .cse14 .cse9 .cse15 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse16))) [2019-11-27 22:34:40,584 INFO L246 CegarLoopResult]: For program point L229-2(lines 229 240) no Hoare annotation was computed. [2019-11-27 22:34:40,585 INFO L246 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-27 22:34:40,585 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 671) no Hoare annotation was computed. [2019-11-27 22:34:40,585 INFO L249 CegarLoopResult]: At program point L660(lines 98 661) the Hoare annotation is: true [2019-11-27 22:34:40,585 INFO L246 CegarLoopResult]: For program point L396(lines 396 402) no Hoare annotation was computed. [2019-11-27 22:34:40,585 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-27 22:34:40,586 INFO L246 CegarLoopResult]: For program point L198(lines 198 596) no Hoare annotation was computed. [2019-11-27 22:34:40,586 INFO L246 CegarLoopResult]: For program point L165(lines 165 607) no Hoare annotation was computed. [2019-11-27 22:34:40,586 INFO L246 CegarLoopResult]: For program point L132(lines 132 618) no Hoare annotation was computed. [2019-11-27 22:34:40,586 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 659) the Hoare annotation is: (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse2 .cse3 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593))))) [2019-11-27 22:34:40,587 INFO L242 CegarLoopResult]: At program point L166(lines 165 607) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse8 .cse11 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse12))) [2019-11-27 22:34:40,587 INFO L242 CegarLoopResult]: At program point L133(lines 126 620) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse13) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8577)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8593)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse9 .cse11 .cse13 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-27 22:34:40,587 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 22:34:40,587 INFO L246 CegarLoopResult]: For program point L629(lines 629 657) no Hoare annotation was computed. [2019-11-27 22:34:40,588 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-11-27 22:34:40,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:40 BoogieIcfgContainer [2019-11-27 22:34:40,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:40,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:40,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:40,640 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:40,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:14" (3/4) ... [2019-11-27 22:34:40,644 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:40,663 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:34:40,664 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:34:40,809 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:40,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:40,811 INFO L168 Benchmark]: Toolchain (without parser) took 27574.38 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 952.3 MB in the beginning and 1.8 GB in the end (delta: -804.6 MB). Peak memory consumption was 436.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,811 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:40,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.24 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,812 INFO L168 Benchmark]: Boogie Preprocessor took 39.93 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-27 22:34:40,813 INFO L168 Benchmark]: RCFGBuilder took 834.55 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,813 INFO L168 Benchmark]: TraceAbstraction took 25974.47 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -715.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,813 INFO L168 Benchmark]: Witness Printer took 169.58 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:40,816 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.24 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.93 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 834.55 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25974.47 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -715.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 169.58 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 671]: 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: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8577) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8496)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((blastFlag <= 2 && !(s__state == 8448)) && s__state <= 8448) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8448 <= s__state) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && s__state <= 8576) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 3 && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && 8448 <= s__state) && !(s__state == 8528)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8529)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8657)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(0 == s__hit)) || (((((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (((s__state <= 8672 && s__s3__tmp__next_state___0 <= 8576) && blastFlag <= 3) && 8672 <= s__state)) || (((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && 8448 <= s__state) && !(s__state == 8513)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545))) || (blastFlag <= 3 && !(0 == s__hit))) || (((((((blastFlag <= 2 && !(s__state == 8577)) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8657)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__state == 8593)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8577)) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && 8448 <= s__state) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && s__state <= 8672) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) || (((((((((((((((((((((((((!(s__state == 8577) && blastFlag <= 3) && !(s__state == 8608)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8576)) && !(s__state == 8641)) && !(s__state == 8496)) && !(s__state == 8640)) && !(s__state == 8609)) && !(s__state == 8593)) && !(s__state == 8545)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 1 error locations. Result: SAFE, OverallTime: 16.4s, OverallIterations: 37, TraceHistogramMax: 25, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.4s, HoareTripleCheckerStatistics: 5821 SDtfs, 4958 SDslu, 2005 SDs, 0 SdLazy, 3403 SolverSat, 1378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1278 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 227 NumberOfFragments, 3549 HoareAnnotationTreeSize, 29 FomulaSimplifications, 33715 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7568 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 9471 NumberOfCodeBlocks, 9471 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 9431 ConstructedInterpolants, 0 QuantifiedInterpolants, 4588760 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 40 InterpolantComputations, 35 PerfectInterpolantSequences, 40583/40713 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...