./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.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 0e3531ca2da4bd0098c9a389bd0b7db6a2819ab0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:09:37,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:09:37,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:09:37,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:09:37,813 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:09:37,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:09:37,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:09:37,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:09:37,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:09:37,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:09:37,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:09:37,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:09:37,832 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:09:37,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:09:37,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:09:37,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:09:37,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:09:37,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:09:37,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:09:37,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:09:37,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:09:37,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:09:37,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:09:37,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:09:37,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:09:37,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:09:37,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:09:37,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:09:37,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:09:37,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:09:37,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:09:37,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:09:37,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:09:37,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:09:37,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:09:37,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:09:37,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:09:37,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:09:37,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:09:37,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:09:37,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:09:37,916 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:09:37,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:09:37,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:09:37,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:09:37,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:09:37,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:09:37,917 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:09:37,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:09:37,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:09:37,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:09:37,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:09:37,918 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:09:37,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:09:37,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:09:37,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:09:37,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:09:37,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:09:37,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:09:37,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:09:37,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:09:37,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:09:37,921 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:09:37,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:09:37,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:09:37,923 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 0e3531ca2da4bd0098c9a389bd0b7db6a2819ab0 [2018-12-30 16:09:37,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:09:37,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:09:37,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:09:37,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:09:37,994 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:09:37,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:38,061 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6a12a6b/f041d6401cdf47adad9ea95ac11a4caa/FLAG9aaf29510 [2018-12-30 16:09:38,638 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:09:38,639 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_8_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:38,651 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6a12a6b/f041d6401cdf47adad9ea95ac11a4caa/FLAG9aaf29510 [2018-12-30 16:09:38,928 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6a12a6b/f041d6401cdf47adad9ea95ac11a4caa [2018-12-30 16:09:38,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:09:38,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:09:38,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:38,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:09:38,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:09:38,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:38" (1/1) ... [2018-12-30 16:09:38,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0f8a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:38, skipping insertion in model container [2018-12-30 16:09:38,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:09:38" (1/1) ... [2018-12-30 16:09:38,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:09:39,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:09:39,407 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:39,417 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:09:39,515 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:09:39,535 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:09:39,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39 WrapperNode [2018-12-30 16:09:39,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:09:39,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:39,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:09:39,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:09:39,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:09:39,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:09:39,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:09:39,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:09:39,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (1/1) ... [2018-12-30 16:09:39,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:09:39,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:09:39,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:09:39,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:09:39,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (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 [2018-12-30 16:09:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:09:39,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:09:39,943 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:09:39,944 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:09:41,163 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:09:41,164 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:09:41,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:41 BoogieIcfgContainer [2018-12-30 16:09:41,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:09:41,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:09:41,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:09:41,169 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:09:41,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:09:38" (1/3) ... [2018-12-30 16:09:41,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692e47cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:41, skipping insertion in model container [2018-12-30 16:09:41,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:09:39" (2/3) ... [2018-12-30 16:09:41,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692e47cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:09:41, skipping insertion in model container [2018-12-30 16:09:41,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:41" (3/3) ... [2018-12-30 16:09:41,175 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_8_true-unreach-call_false-termination.cil.c [2018-12-30 16:09:41,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:09:41,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:09:41,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:09:41,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:09:41,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:09:41,241 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:09:41,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:09:41,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:09:41,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:09:41,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:09:41,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:09:41,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:09:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-12-30 16:09:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 16:09:41,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:41,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:41,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707020, now seen corresponding path program 1 times [2018-12-30 16:09:41,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:41,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:41,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:41,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:41,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:41,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:41,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:41,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:41,608 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2018-12-30 16:09:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:42,462 INFO L93 Difference]: Finished difference Result 338 states and 585 transitions. [2018-12-30 16:09:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:42,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-30 16:09:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:42,480 INFO L225 Difference]: With dead ends: 338 [2018-12-30 16:09:42,480 INFO L226 Difference]: Without dead ends: 179 [2018-12-30 16:09:42,485 INFO L631 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 [2018-12-30 16:09:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-30 16:09:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-12-30 16:09:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-30 16:09:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 278 transitions. [2018-12-30 16:09:42,548 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 278 transitions. Word has length 41 [2018-12-30 16:09:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:42,549 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 278 transitions. [2018-12-30 16:09:42,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 278 transitions. [2018-12-30 16:09:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-30 16:09:42,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:42,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:42,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716333, now seen corresponding path program 1 times [2018-12-30 16:09:42,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:42,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:42,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:42,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:42,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:42,695 INFO L87 Difference]: Start difference. First operand 171 states and 278 transitions. Second operand 3 states. [2018-12-30 16:09:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:43,109 INFO L93 Difference]: Finished difference Result 382 states and 630 transitions. [2018-12-30 16:09:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:43,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-30 16:09:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:43,115 INFO L225 Difference]: With dead ends: 382 [2018-12-30 16:09:43,115 INFO L226 Difference]: Without dead ends: 218 [2018-12-30 16:09:43,117 INFO L631 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 [2018-12-30 16:09:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-30 16:09:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-12-30 16:09:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-30 16:09:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2018-12-30 16:09:43,137 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 42 [2018-12-30 16:09:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:43,138 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2018-12-30 16:09:43,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2018-12-30 16:09:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-30 16:09:43,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:43,143 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:43,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1839414983, now seen corresponding path program 1 times [2018-12-30 16:09:43,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:43,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:43,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:43,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:43,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:43,281 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2018-12-30 16:09:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:43,709 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2018-12-30 16:09:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:43,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-30 16:09:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:43,715 INFO L225 Difference]: With dead ends: 444 [2018-12-30 16:09:43,715 INFO L226 Difference]: Without dead ends: 241 [2018-12-30 16:09:43,716 INFO L631 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 [2018-12-30 16:09:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-30 16:09:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-12-30 16:09:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-30 16:09:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2018-12-30 16:09:43,735 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 69 [2018-12-30 16:09:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:43,736 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2018-12-30 16:09:43,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2018-12-30 16:09:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-30 16:09:43,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:43,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:43,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1554149248, now seen corresponding path program 1 times [2018-12-30 16:09:43,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:43,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:43,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:43,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:43,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:43,851 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2018-12-30 16:09:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:44,241 INFO L93 Difference]: Finished difference Result 513 states and 872 transitions. [2018-12-30 16:09:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:44,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-30 16:09:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:44,246 INFO L225 Difference]: With dead ends: 513 [2018-12-30 16:09:44,247 INFO L226 Difference]: Without dead ends: 279 [2018-12-30 16:09:44,248 INFO L631 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 [2018-12-30 16:09:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-30 16:09:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-12-30 16:09:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-30 16:09:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 472 transitions. [2018-12-30 16:09:44,266 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 472 transitions. Word has length 74 [2018-12-30 16:09:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:44,266 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 472 transitions. [2018-12-30 16:09:44,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 472 transitions. [2018-12-30 16:09:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-30 16:09:44,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:44,271 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:44,271 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1571310151, now seen corresponding path program 1 times [2018-12-30 16:09:44,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:44,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:44,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:44,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:09:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:44,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:44,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:44,393 INFO L87 Difference]: Start difference. First operand 277 states and 472 transitions. Second operand 3 states. [2018-12-30 16:09:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:44,717 INFO L93 Difference]: Finished difference Result 549 states and 935 transitions. [2018-12-30 16:09:44,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:44,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-30 16:09:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:44,721 INFO L225 Difference]: With dead ends: 549 [2018-12-30 16:09:44,721 INFO L226 Difference]: Without dead ends: 279 [2018-12-30 16:09:44,722 INFO L631 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 [2018-12-30 16:09:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-30 16:09:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-12-30 16:09:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-30 16:09:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 470 transitions. [2018-12-30 16:09:44,739 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 470 transitions. Word has length 75 [2018-12-30 16:09:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:44,740 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 470 transitions. [2018-12-30 16:09:44,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 470 transitions. [2018-12-30 16:09:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-30 16:09:44,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:44,744 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:44,745 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1779493469, now seen corresponding path program 1 times [2018-12-30 16:09:44,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:44,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:44,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:44,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:44,836 INFO L87 Difference]: Start difference. First operand 277 states and 470 transitions. Second operand 3 states. [2018-12-30 16:09:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:45,332 INFO L93 Difference]: Finished difference Result 564 states and 957 transitions. [2018-12-30 16:09:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:45,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-30 16:09:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:45,337 INFO L225 Difference]: With dead ends: 564 [2018-12-30 16:09:45,337 INFO L226 Difference]: Without dead ends: 294 [2018-12-30 16:09:45,338 INFO L631 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 [2018-12-30 16:09:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-30 16:09:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-12-30 16:09:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-30 16:09:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2018-12-30 16:09:45,351 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 81 [2018-12-30 16:09:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:45,351 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2018-12-30 16:09:45,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2018-12-30 16:09:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-30 16:09:45,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:45,356 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:45,356 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 685947497, now seen corresponding path program 1 times [2018-12-30 16:09:45,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:45,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:45,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:45,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:45,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:45,450 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 3 states. [2018-12-30 16:09:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:46,014 INFO L93 Difference]: Finished difference Result 579 states and 975 transitions. [2018-12-30 16:09:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:46,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-30 16:09:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:46,017 INFO L225 Difference]: With dead ends: 579 [2018-12-30 16:09:46,017 INFO L226 Difference]: Without dead ends: 294 [2018-12-30 16:09:46,024 INFO L631 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 [2018-12-30 16:09:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-30 16:09:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-12-30 16:09:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-30 16:09:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 488 transitions. [2018-12-30 16:09:46,038 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 488 transitions. Word has length 82 [2018-12-30 16:09:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:46,039 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 488 transitions. [2018-12-30 16:09:46,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 488 transitions. [2018-12-30 16:09:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-30 16:09:46,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:46,041 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:46,042 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash -166367862, now seen corresponding path program 1 times [2018-12-30 16:09:46,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:46,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-30 16:09:46,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:46,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:46,146 INFO L87 Difference]: Start difference. First operand 292 states and 488 transitions. Second operand 3 states. [2018-12-30 16:09:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:46,510 INFO L93 Difference]: Finished difference Result 586 states and 977 transitions. [2018-12-30 16:09:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:46,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-30 16:09:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:46,512 INFO L225 Difference]: With dead ends: 586 [2018-12-30 16:09:46,512 INFO L226 Difference]: Without dead ends: 301 [2018-12-30 16:09:46,513 INFO L631 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 [2018-12-30 16:09:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-30 16:09:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-12-30 16:09:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-30 16:09:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 494 transitions. [2018-12-30 16:09:46,531 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 494 transitions. Word has length 94 [2018-12-30 16:09:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:46,532 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 494 transitions. [2018-12-30 16:09:46,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 494 transitions. [2018-12-30 16:09:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-30 16:09:46,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:46,533 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:46,534 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1087158848, now seen corresponding path program 1 times [2018-12-30 16:09:46,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:46,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:46,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:46,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:46,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:46,646 INFO L87 Difference]: Start difference. First operand 301 states and 494 transitions. Second operand 3 states. [2018-12-30 16:09:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:47,972 INFO L93 Difference]: Finished difference Result 626 states and 1030 transitions. [2018-12-30 16:09:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:47,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-30 16:09:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:47,978 INFO L225 Difference]: With dead ends: 626 [2018-12-30 16:09:47,978 INFO L226 Difference]: Without dead ends: 332 [2018-12-30 16:09:47,979 INFO L631 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 [2018-12-30 16:09:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-30 16:09:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-12-30 16:09:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-30 16:09:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 541 transitions. [2018-12-30 16:09:47,992 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 541 transitions. Word has length 95 [2018-12-30 16:09:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:47,992 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 541 transitions. [2018-12-30 16:09:47,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 541 transitions. [2018-12-30 16:09:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-30 16:09:47,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:47,994 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:47,994 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2088595028, now seen corresponding path program 1 times [2018-12-30 16:09:47,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:47,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:47,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:48,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:48,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:48,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:48,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:48,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:48,080 INFO L87 Difference]: Start difference. First operand 330 states and 541 transitions. Second operand 3 states. [2018-12-30 16:09:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:48,850 INFO L93 Difference]: Finished difference Result 655 states and 1073 transitions. [2018-12-30 16:09:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:48,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-30 16:09:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:48,854 INFO L225 Difference]: With dead ends: 655 [2018-12-30 16:09:48,854 INFO L226 Difference]: Without dead ends: 332 [2018-12-30 16:09:48,855 INFO L631 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 [2018-12-30 16:09:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-30 16:09:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-12-30 16:09:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-30 16:09:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 537 transitions. [2018-12-30 16:09:48,866 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 537 transitions. Word has length 96 [2018-12-30 16:09:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:48,866 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 537 transitions. [2018-12-30 16:09:48,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 537 transitions. [2018-12-30 16:09:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-30 16:09:48,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:48,868 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:48,868 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:48,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2096161680, now seen corresponding path program 1 times [2018-12-30 16:09:48,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:48,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:48,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:48,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:48,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:48,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:48,920 INFO L87 Difference]: Start difference. First operand 330 states and 537 transitions. Second operand 3 states. [2018-12-30 16:09:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:49,711 INFO L93 Difference]: Finished difference Result 688 states and 1123 transitions. [2018-12-30 16:09:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:49,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-12-30 16:09:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:49,713 INFO L225 Difference]: With dead ends: 688 [2018-12-30 16:09:49,713 INFO L226 Difference]: Without dead ends: 365 [2018-12-30 16:09:49,714 INFO L631 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 [2018-12-30 16:09:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-12-30 16:09:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2018-12-30 16:09:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-30 16:09:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 579 transitions. [2018-12-30 16:09:49,727 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 579 transitions. Word has length 97 [2018-12-30 16:09:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:49,728 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 579 transitions. [2018-12-30 16:09:49,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 579 transitions. [2018-12-30 16:09:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 16:09:49,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:49,729 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:49,730 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -297892004, now seen corresponding path program 1 times [2018-12-30 16:09:49,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:49,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:49,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:49,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:49,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:49,815 INFO L87 Difference]: Start difference. First operand 357 states and 579 transitions. Second operand 3 states. [2018-12-30 16:09:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:50,534 INFO L93 Difference]: Finished difference Result 715 states and 1160 transitions. [2018-12-30 16:09:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:50,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-30 16:09:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:50,539 INFO L225 Difference]: With dead ends: 715 [2018-12-30 16:09:50,539 INFO L226 Difference]: Without dead ends: 365 [2018-12-30 16:09:50,540 INFO L631 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 [2018-12-30 16:09:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-12-30 16:09:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2018-12-30 16:09:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-30 16:09:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2018-12-30 16:09:50,552 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 98 [2018-12-30 16:09:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:50,553 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2018-12-30 16:09:50,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2018-12-30 16:09:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 16:09:50,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:50,555 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:50,555 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash 386381809, now seen corresponding path program 1 times [2018-12-30 16:09:50,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:50,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-30 16:09:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:50,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:50,630 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand 3 states. [2018-12-30 16:09:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:51,118 INFO L93 Difference]: Finished difference Result 743 states and 1195 transitions. [2018-12-30 16:09:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:51,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-30 16:09:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:51,121 INFO L225 Difference]: With dead ends: 743 [2018-12-30 16:09:51,121 INFO L226 Difference]: Without dead ends: 393 [2018-12-30 16:09:51,122 INFO L631 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 [2018-12-30 16:09:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-30 16:09:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2018-12-30 16:09:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-30 16:09:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 627 transitions. [2018-12-30 16:09:51,139 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 627 transitions. Word has length 105 [2018-12-30 16:09:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:51,139 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 627 transitions. [2018-12-30 16:09:51,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 627 transitions. [2018-12-30 16:09:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-30 16:09:51,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:51,141 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:51,142 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1882644280, now seen corresponding path program 1 times [2018-12-30 16:09:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:51,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-30 16:09:51,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:51,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:51,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:51,240 INFO L87 Difference]: Start difference. First operand 391 states and 627 transitions. Second operand 3 states. [2018-12-30 16:09:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:51,798 INFO L93 Difference]: Finished difference Result 777 states and 1245 transitions. [2018-12-30 16:09:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:51,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-12-30 16:09:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:51,801 INFO L225 Difference]: With dead ends: 777 [2018-12-30 16:09:51,801 INFO L226 Difference]: Without dead ends: 393 [2018-12-30 16:09:51,802 INFO L631 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 [2018-12-30 16:09:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-30 16:09:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2018-12-30 16:09:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-30 16:09:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 624 transitions. [2018-12-30 16:09:51,817 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 624 transitions. Word has length 106 [2018-12-30 16:09:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:51,818 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 624 transitions. [2018-12-30 16:09:51,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 624 transitions. [2018-12-30 16:09:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-30 16:09:51,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:51,820 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:51,820 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1260059449, now seen corresponding path program 1 times [2018-12-30 16:09:51,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:51,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:51,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:51,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:51,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:51,924 INFO L87 Difference]: Start difference. First operand 391 states and 624 transitions. Second operand 3 states. [2018-12-30 16:09:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:52,400 INFO L93 Difference]: Finished difference Result 822 states and 1311 transitions. [2018-12-30 16:09:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:52,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-30 16:09:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:52,403 INFO L225 Difference]: With dead ends: 822 [2018-12-30 16:09:52,404 INFO L226 Difference]: Without dead ends: 438 [2018-12-30 16:09:52,404 INFO L631 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 [2018-12-30 16:09:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-12-30 16:09:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 433. [2018-12-30 16:09:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-12-30 16:09:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 689 transitions. [2018-12-30 16:09:52,419 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 689 transitions. Word has length 111 [2018-12-30 16:09:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:52,422 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 689 transitions. [2018-12-30 16:09:52,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 689 transitions. [2018-12-30 16:09:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-30 16:09:52,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:52,424 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:52,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1753706176, now seen corresponding path program 1 times [2018-12-30 16:09:52,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:52,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:52,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-30 16:09:52,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:52,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:52,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:52,536 INFO L87 Difference]: Start difference. First operand 433 states and 689 transitions. Second operand 3 states. [2018-12-30 16:09:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:52,838 INFO L93 Difference]: Finished difference Result 868 states and 1382 transitions. [2018-12-30 16:09:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:52,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-30 16:09:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:52,842 INFO L225 Difference]: With dead ends: 868 [2018-12-30 16:09:52,843 INFO L226 Difference]: Without dead ends: 440 [2018-12-30 16:09:52,844 INFO L631 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 [2018-12-30 16:09:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-12-30 16:09:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 435. [2018-12-30 16:09:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-12-30 16:09:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 692 transitions. [2018-12-30 16:09:52,857 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 692 transitions. Word has length 112 [2018-12-30 16:09:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:52,857 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 692 transitions. [2018-12-30 16:09:52,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 692 transitions. [2018-12-30 16:09:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-30 16:09:52,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:52,861 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:52,861 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash 793971013, now seen corresponding path program 1 times [2018-12-30 16:09:52,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:52,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 16:09:52,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:52,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:52,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:52,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:52,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:52,958 INFO L87 Difference]: Start difference. First operand 435 states and 692 transitions. Second operand 3 states. [2018-12-30 16:09:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:53,674 INFO L93 Difference]: Finished difference Result 901 states and 1437 transitions. [2018-12-30 16:09:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:53,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-30 16:09:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:53,679 INFO L225 Difference]: With dead ends: 901 [2018-12-30 16:09:53,679 INFO L226 Difference]: Without dead ends: 473 [2018-12-30 16:09:53,680 INFO L631 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 [2018-12-30 16:09:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-12-30 16:09:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2018-12-30 16:09:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-30 16:09:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 727 transitions. [2018-12-30 16:09:53,695 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 727 transitions. Word has length 123 [2018-12-30 16:09:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:53,696 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 727 transitions. [2018-12-30 16:09:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 727 transitions. [2018-12-30 16:09:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-30 16:09:53,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:53,700 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:53,700 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2143195791, now seen corresponding path program 1 times [2018-12-30 16:09:53,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:53,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:53,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:53,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-30 16:09:53,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:53,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:53,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:53,769 INFO L87 Difference]: Start difference. First operand 460 states and 727 transitions. Second operand 3 states. [2018-12-30 16:09:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:54,024 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2018-12-30 16:09:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:54,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-30 16:09:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:54,028 INFO L225 Difference]: With dead ends: 926 [2018-12-30 16:09:54,029 INFO L226 Difference]: Without dead ends: 473 [2018-12-30 16:09:54,030 INFO L631 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 [2018-12-30 16:09:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-12-30 16:09:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 460. [2018-12-30 16:09:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-30 16:09:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 719 transitions. [2018-12-30 16:09:54,043 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 719 transitions. Word has length 124 [2018-12-30 16:09:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:54,043 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 719 transitions. [2018-12-30 16:09:54,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 719 transitions. [2018-12-30 16:09:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-30 16:09:54,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:54,045 INFO L402 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, 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] [2018-12-30 16:09:54,045 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -418940064, now seen corresponding path program 1 times [2018-12-30 16:09:54,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-30 16:09:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:54,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:54,128 INFO L87 Difference]: Start difference. First operand 460 states and 719 transitions. Second operand 3 states. [2018-12-30 16:09:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:54,828 INFO L93 Difference]: Finished difference Result 917 states and 1432 transitions. [2018-12-30 16:09:54,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:54,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-12-30 16:09:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:54,832 INFO L225 Difference]: With dead ends: 917 [2018-12-30 16:09:54,832 INFO L226 Difference]: Without dead ends: 464 [2018-12-30 16:09:54,833 INFO L631 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 [2018-12-30 16:09:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-30 16:09:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2018-12-30 16:09:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-30 16:09:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2018-12-30 16:09:54,847 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 136 [2018-12-30 16:09:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:54,847 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2018-12-30 16:09:54,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2018-12-30 16:09:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-30 16:09:54,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:54,849 INFO L402 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, 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] [2018-12-30 16:09:54,849 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 307186329, now seen corresponding path program 1 times [2018-12-30 16:09:54,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-30 16:09:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:54,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:54,935 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand 3 states. [2018-12-30 16:09:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:55,175 INFO L93 Difference]: Finished difference Result 917 states and 1422 transitions. [2018-12-30 16:09:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:55,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-12-30 16:09:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:55,179 INFO L225 Difference]: With dead ends: 917 [2018-12-30 16:09:55,179 INFO L226 Difference]: Without dead ends: 464 [2018-12-30 16:09:55,180 INFO L631 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 [2018-12-30 16:09:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-30 16:09:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 460. [2018-12-30 16:09:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-30 16:09:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 709 transitions. [2018-12-30 16:09:55,193 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 709 transitions. Word has length 137 [2018-12-30 16:09:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:55,193 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 709 transitions. [2018-12-30 16:09:55,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 709 transitions. [2018-12-30 16:09:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-30 16:09:55,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:55,195 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:55,195 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 791534820, now seen corresponding path program 1 times [2018-12-30 16:09:55,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:09:55,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:55,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:55,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:55,255 INFO L87 Difference]: Start difference. First operand 460 states and 709 transitions. Second operand 3 states. [2018-12-30 16:09:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:56,354 INFO L93 Difference]: Finished difference Result 941 states and 1452 transitions. [2018-12-30 16:09:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:56,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-12-30 16:09:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:56,358 INFO L225 Difference]: With dead ends: 941 [2018-12-30 16:09:56,359 INFO L226 Difference]: Without dead ends: 488 [2018-12-30 16:09:56,360 INFO L631 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 [2018-12-30 16:09:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-30 16:09:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2018-12-30 16:09:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-30 16:09:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 740 transitions. [2018-12-30 16:09:56,378 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 740 transitions. Word has length 144 [2018-12-30 16:09:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:56,379 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 740 transitions. [2018-12-30 16:09:56,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 740 transitions. [2018-12-30 16:09:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-30 16:09:56,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:56,381 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:56,381 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:56,382 INFO L82 PathProgramCache]: Analyzing trace with hash -335636264, now seen corresponding path program 1 times [2018-12-30 16:09:56,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:56,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:56,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-30 16:09:56,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:56,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:56,451 INFO L87 Difference]: Start difference. First operand 484 states and 740 transitions. Second operand 3 states. [2018-12-30 16:09:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:56,631 INFO L93 Difference]: Finished difference Result 965 states and 1474 transitions. [2018-12-30 16:09:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:56,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-12-30 16:09:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:56,637 INFO L225 Difference]: With dead ends: 965 [2018-12-30 16:09:56,637 INFO L226 Difference]: Without dead ends: 488 [2018-12-30 16:09:56,638 INFO L631 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 [2018-12-30 16:09:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-30 16:09:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2018-12-30 16:09:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-30 16:09:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 731 transitions. [2018-12-30 16:09:56,653 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 731 transitions. Word has length 145 [2018-12-30 16:09:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:56,653 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 731 transitions. [2018-12-30 16:09:56,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 731 transitions. [2018-12-30 16:09:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-30 16:09:56,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:56,657 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:56,657 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -122343295, now seen corresponding path program 1 times [2018-12-30 16:09:56,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:56,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:56,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-30 16:09:56,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:56,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:56,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:56,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:56,729 INFO L87 Difference]: Start difference. First operand 484 states and 731 transitions. Second operand 3 states. [2018-12-30 16:09:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:56,909 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2018-12-30 16:09:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:56,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-12-30 16:09:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:56,913 INFO L225 Difference]: With dead ends: 1008 [2018-12-30 16:09:56,914 INFO L226 Difference]: Without dead ends: 531 [2018-12-30 16:09:56,915 INFO L631 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 [2018-12-30 16:09:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-30 16:09:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 525. [2018-12-30 16:09:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-12-30 16:09:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 786 transitions. [2018-12-30 16:09:56,932 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 786 transitions. Word has length 151 [2018-12-30 16:09:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:56,932 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 786 transitions. [2018-12-30 16:09:56,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 786 transitions. [2018-12-30 16:09:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-30 16:09:56,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:56,935 INFO L402 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, 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] [2018-12-30 16:09:56,936 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:56,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1907415640, now seen corresponding path program 1 times [2018-12-30 16:09:56,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:56,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-30 16:09:57,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:57,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:57,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:57,033 INFO L87 Difference]: Start difference. First operand 525 states and 786 transitions. Second operand 3 states. [2018-12-30 16:09:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:57,249 INFO L93 Difference]: Finished difference Result 1049 states and 1570 transitions. [2018-12-30 16:09:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:57,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-12-30 16:09:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:57,253 INFO L225 Difference]: With dead ends: 1049 [2018-12-30 16:09:57,254 INFO L226 Difference]: Without dead ends: 512 [2018-12-30 16:09:57,255 INFO L631 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 [2018-12-30 16:09:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-12-30 16:09:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-12-30 16:09:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-12-30 16:09:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 756 transitions. [2018-12-30 16:09:57,272 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 756 transitions. Word has length 152 [2018-12-30 16:09:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:57,272 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 756 transitions. [2018-12-30 16:09:57,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 756 transitions. [2018-12-30 16:09:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-30 16:09:57,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:57,276 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:57,276 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1249588557, now seen corresponding path program 1 times [2018-12-30 16:09:57,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:57,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-12-30 16:09:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:57,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:57,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:57,364 INFO L87 Difference]: Start difference. First operand 506 states and 756 transitions. Second operand 3 states. [2018-12-30 16:09:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:57,576 INFO L93 Difference]: Finished difference Result 1030 states and 1542 transitions. [2018-12-30 16:09:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:57,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-12-30 16:09:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:57,581 INFO L225 Difference]: With dead ends: 1030 [2018-12-30 16:09:57,581 INFO L226 Difference]: Without dead ends: 531 [2018-12-30 16:09:57,582 INFO L631 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 [2018-12-30 16:09:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-30 16:09:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-12-30 16:09:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-12-30 16:09:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 780 transitions. [2018-12-30 16:09:57,599 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 780 transitions. Word has length 165 [2018-12-30 16:09:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:57,600 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 780 transitions. [2018-12-30 16:09:57,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 780 transitions. [2018-12-30 16:09:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-30 16:09:57,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:57,601 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:57,601 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1409544545, now seen corresponding path program 1 times [2018-12-30 16:09:57,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:57,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:57,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:57,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-12-30 16:09:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:09:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:09:57,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:09:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:09:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:09:57,703 INFO L87 Difference]: Start difference. First operand 527 states and 780 transitions. Second operand 3 states. [2018-12-30 16:09:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:09:58,880 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2018-12-30 16:09:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:09:58,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-12-30 16:09:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:09:58,885 INFO L225 Difference]: With dead ends: 1051 [2018-12-30 16:09:58,885 INFO L226 Difference]: Without dead ends: 529 [2018-12-30 16:09:58,886 INFO L631 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 [2018-12-30 16:09:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-30 16:09:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 525. [2018-12-30 16:09:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-12-30 16:09:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2018-12-30 16:09:58,904 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 166 [2018-12-30 16:09:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:09:58,904 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2018-12-30 16:09:58,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:09:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2018-12-30 16:09:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-30 16:09:58,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:09:58,907 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:09:58,908 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:09:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:09:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1453747987, now seen corresponding path program 1 times [2018-12-30 16:09:58,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:09:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:09:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:09:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-12-30 16:09:59,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:09:59,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:09:59,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:09:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:09:59,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:09:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-30 16:09:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:09:59,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:09:59,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:09:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:09:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:09:59,436 INFO L87 Difference]: Start difference. First operand 525 states and 766 transitions. Second operand 5 states. [2018-12-30 16:10:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:03,676 INFO L93 Difference]: Finished difference Result 2591 states and 3766 transitions. [2018-12-30 16:10:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:10:03,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-12-30 16:10:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:03,688 INFO L225 Difference]: With dead ends: 2591 [2018-12-30 16:10:03,688 INFO L226 Difference]: Without dead ends: 2051 [2018-12-30 16:10:03,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:10:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2018-12-30 16:10:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1175. [2018-12-30 16:10:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-12-30 16:10:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1686 transitions. [2018-12-30 16:10:03,745 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1686 transitions. Word has length 181 [2018-12-30 16:10:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:03,745 INFO L480 AbstractCegarLoop]: Abstraction has 1175 states and 1686 transitions. [2018-12-30 16:10:03,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:10:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1686 transitions. [2018-12-30 16:10:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-30 16:10:03,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:03,752 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 16:10:03,752 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676108, now seen corresponding path program 1 times [2018-12-30 16:10:03,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:03,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-30 16:10:03,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:03,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:03,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:03,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:03,879 INFO L87 Difference]: Start difference. First operand 1175 states and 1686 transitions. Second operand 3 states. [2018-12-30 16:10:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:04,431 INFO L93 Difference]: Finished difference Result 2920 states and 4193 transitions. [2018-12-30 16:10:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:04,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-12-30 16:10:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:04,443 INFO L225 Difference]: With dead ends: 2920 [2018-12-30 16:10:04,443 INFO L226 Difference]: Without dead ends: 1752 [2018-12-30 16:10:04,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-12-30 16:10:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2018-12-30 16:10:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2018-12-30 16:10:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2509 transitions. [2018-12-30 16:10:04,517 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2509 transitions. Word has length 188 [2018-12-30 16:10:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 1752 states and 2509 transitions. [2018-12-30 16:10:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2509 transitions. [2018-12-30 16:10:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-30 16:10:04,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:04,524 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:04,524 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash -373781024, now seen corresponding path program 1 times [2018-12-30 16:10:04,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:04,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:04,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-30 16:10:04,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:04,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:04,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:04,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:04,632 INFO L87 Difference]: Start difference. First operand 1752 states and 2509 transitions. Second operand 3 states. [2018-12-30 16:10:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,211 INFO L93 Difference]: Finished difference Result 3972 states and 5676 transitions. [2018-12-30 16:10:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-12-30 16:10:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,223 INFO L225 Difference]: With dead ends: 3972 [2018-12-30 16:10:05,224 INFO L226 Difference]: Without dead ends: 2227 [2018-12-30 16:10:05,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-12-30 16:10:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2227. [2018-12-30 16:10:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2227 states. [2018-12-30 16:10:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3169 transitions. [2018-12-30 16:10:05,310 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3169 transitions. Word has length 189 [2018-12-30 16:10:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,311 INFO L480 AbstractCegarLoop]: Abstraction has 2227 states and 3169 transitions. [2018-12-30 16:10:05,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3169 transitions. [2018-12-30 16:10:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-30 16:10:05,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,319 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:05,319 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1948421128, now seen corresponding path program 1 times [2018-12-30 16:10:05,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-12-30 16:10:05,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:05,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:05,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,535 INFO L87 Difference]: Start difference. First operand 2227 states and 3169 transitions. Second operand 3 states. [2018-12-30 16:10:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:05,809 INFO L93 Difference]: Finished difference Result 5858 states and 8299 transitions. [2018-12-30 16:10:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:05,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2018-12-30 16:10:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:05,827 INFO L225 Difference]: With dead ends: 5858 [2018-12-30 16:10:05,827 INFO L226 Difference]: Without dead ends: 3638 [2018-12-30 16:10:05,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2018-12-30 16:10:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3636. [2018-12-30 16:10:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-12-30 16:10:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5131 transitions. [2018-12-30 16:10:05,965 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5131 transitions. Word has length 338 [2018-12-30 16:10:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:05,965 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 5131 transitions. [2018-12-30 16:10:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5131 transitions. [2018-12-30 16:10:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-30 16:10:05,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:05,973 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 16:10:05,975 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1969862083, now seen corresponding path program 1 times [2018-12-30 16:10:05,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:05,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:05,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-12-30 16:10:06,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,147 INFO L87 Difference]: Start difference. First operand 3636 states and 5131 transitions. Second operand 3 states. [2018-12-30 16:10:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,185 INFO L93 Difference]: Finished difference Result 7425 states and 10491 transitions. [2018-12-30 16:10:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2018-12-30 16:10:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,199 INFO L225 Difference]: With dead ends: 7425 [2018-12-30 16:10:07,199 INFO L226 Difference]: Without dead ends: 2367 [2018-12-30 16:10:07,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2018-12-30 16:10:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2018-12-30 16:10:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2018-12-30 16:10:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3265 transitions. [2018-12-30 16:10:07,297 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3265 transitions. Word has length 375 [2018-12-30 16:10:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,297 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 3265 transitions. [2018-12-30 16:10:07,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3265 transitions. [2018-12-30 16:10:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-12-30 16:10:07,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,307 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 13, 11, 11, 9, 9, 7, 7, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,309 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1778796496, now seen corresponding path program 1 times [2018-12-30 16:10:07,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 3000 proven. 26 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2018-12-30 16:10:07,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:10:07,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 16:10:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:10:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 1432 proven. 0 refuted. 0 times theorem prover too weak. 3579 trivial. 0 not checked. [2018-12-30 16:10:08,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:10:08,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 16:10:08,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:10:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:10:08,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:10:08,531 INFO L87 Difference]: Start difference. First operand 2367 states and 3265 transitions. Second operand 5 states. [2018-12-30 16:10:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,960 INFO L93 Difference]: Finished difference Result 5000 states and 6924 transitions. [2018-12-30 16:10:08,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:10:08,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 671 [2018-12-30 16:10:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,973 INFO L225 Difference]: With dead ends: 5000 [2018-12-30 16:10:08,973 INFO L226 Difference]: Without dead ends: 2502 [2018-12-30 16:10:08,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:10:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2018-12-30 16:10:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1814. [2018-12-30 16:10:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2018-12-30 16:10:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2487 transitions. [2018-12-30 16:10:09,055 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2487 transitions. Word has length 671 [2018-12-30 16:10:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,056 INFO L480 AbstractCegarLoop]: Abstraction has 1814 states and 2487 transitions. [2018-12-30 16:10:09,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:10:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2487 transitions. [2018-12-30 16:10:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2018-12-30 16:10:09,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,068 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 29, 29, 29, 26, 26, 23, 23, 20, 20, 17, 17, 17, 17, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:09,068 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash -37279638, now seen corresponding path program 1 times [2018-12-30 16:10:09,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 5192 proven. 0 refuted. 0 times theorem prover too weak. 4881 trivial. 0 not checked. [2018-12-30 16:10:09,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,695 INFO L87 Difference]: Start difference. First operand 1814 states and 2487 transitions. Second operand 3 states. [2018-12-30 16:10:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,069 INFO L93 Difference]: Finished difference Result 3721 states and 5098 transitions. [2018-12-30 16:10:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 906 [2018-12-30 16:10:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,077 INFO L225 Difference]: With dead ends: 3721 [2018-12-30 16:10:10,077 INFO L226 Difference]: Without dead ends: 1896 [2018-12-30 16:10:10,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-12-30 16:10:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1856. [2018-12-30 16:10:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2018-12-30 16:10:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2535 transitions. [2018-12-30 16:10:10,155 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2535 transitions. Word has length 906 [2018-12-30 16:10:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,156 INFO L480 AbstractCegarLoop]: Abstraction has 1856 states and 2535 transitions. [2018-12-30 16:10:10,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2535 transitions. [2018-12-30 16:10:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2018-12-30 16:10:10,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,166 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 29, 29, 29, 26, 26, 23, 23, 20, 20, 17, 17, 17, 17, 14, 11, 11, 8, 8, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:10,166 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1785751454, now seen corresponding path program 1 times [2018-12-30 16:10:10,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10295 backedges. 5167 proven. 0 refuted. 0 times theorem prover too weak. 5128 trivial. 0 not checked. [2018-12-30 16:10:10,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:10,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:10,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,808 INFO L87 Difference]: Start difference. First operand 1856 states and 2535 transitions. Second operand 3 states. [2018-12-30 16:10:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:11,173 INFO L93 Difference]: Finished difference Result 2856 states and 3888 transitions. [2018-12-30 16:10:11,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:11,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 921 [2018-12-30 16:10:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:11,176 INFO L225 Difference]: With dead ends: 2856 [2018-12-30 16:10:11,176 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:11,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:11,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 921 [2018-12-30 16:10:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:11,183 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:11,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:11,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:11,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:11,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,793 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 165 [2018-12-30 16:10:11,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:11,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,631 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 165 [2018-12-30 16:10:12,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:12,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 16:10:14,436 WARN L181 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2018-12-30 16:10:17,124 WARN L181 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2018-12-30 16:10:18,823 WARN L181 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-12-30 16:10:21,038 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:22,457 WARN L181 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2018-12-30 16:10:22,975 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:23,694 WARN L181 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-12-30 16:10:24,655 WARN L181 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-30 16:10:25,154 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:25,867 WARN L181 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-12-30 16:10:26,404 WARN L181 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:26,929 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-12-30 16:10:27,132 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-30 16:10:27,860 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-12-30 16:10:30,542 WARN L181 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2018-12-30 16:10:31,044 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:31,608 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2018-12-30 16:10:32,877 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2018-12-30 16:10:34,030 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-12-30 16:10:34,594 WARN L181 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:35,188 WARN L181 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2018-12-30 16:10:36,206 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-30 16:10:36,209 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 537) no Hoare annotation was computed. [2018-12-30 16:10:36,209 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 631) no Hoare annotation was computed. [2018-12-30 16:10:36,209 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:10:36,209 INFO L448 ceAbstractionStarter]: For program point L333-1(lines 333 367) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 569) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 580) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 591) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 602) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 502) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 402) no Hoare annotation was computed. [2018-12-30 16:10:36,210 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 364) no Hoare annotation was computed. [2018-12-30 16:10:36,211 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 570) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse27))) [2018-12-30 16:10:36,211 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 602) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2018-12-30 16:10:36,212 INFO L451 ceAbstractionStarter]: At program point L632(lines 11 634) the Hoare annotation is: true [2018-12-30 16:10:36,212 INFO L444 ceAbstractionStarter]: At program point L566(lines 99 621) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse20 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and (and .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse21 .cse1) (and .cse2 .cse3 .cse4 .cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 .cse13 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (and .cse22 .cse20 .cse23 .cse14) (and .cse0 .cse22 .cse23))) [2018-12-30 16:10:36,212 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 536) no Hoare annotation was computed. [2018-12-30 16:10:36,212 INFO L448 ceAbstractionStarter]: For program point L534-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,212 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 568) no Hoare annotation was computed. [2018-12-30 16:10:36,212 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 579) no Hoare annotation was computed. [2018-12-30 16:10:36,213 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 590) no Hoare annotation was computed. [2018-12-30 16:10:36,213 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 601) no Hoare annotation was computed. [2018-12-30 16:10:36,213 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:10:36,213 INFO L448 ceAbstractionStarter]: For program point L304-2(lines 304 311) no Hoare annotation was computed. [2018-12-30 16:10:36,213 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 568) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:36,213 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 580) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2018-12-30 16:10:36,214 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 591) the Hoare annotation is: (let ((.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (let ((.cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse0 (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16) (and .cse2 .cse3 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16)))) [2018-12-30 16:10:36,214 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 619) no Hoare annotation was computed. [2018-12-30 16:10:36,214 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 514) no Hoare annotation was computed. [2018-12-30 16:10:36,214 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 362) no Hoare annotation was computed. [2018-12-30 16:10:36,214 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 568) the Hoare annotation is: (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 578) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 589) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 600) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 618) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 276) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 610) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L605-2(lines 604 618) no Hoare annotation was computed. [2018-12-30 16:10:36,215 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 442) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 513) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 346) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 253) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 577) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 588) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 599) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2018-12-30 16:10:36,216 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 485) no Hoare annotation was computed. [2018-12-30 16:10:36,217 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 408) no Hoare annotation was computed. [2018-12-30 16:10:36,217 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 247) no Hoare annotation was computed. [2018-12-30 16:10:36,217 INFO L444 ceAbstractionStarter]: At program point L211(lines 105 601) the Hoare annotation is: (let ((.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse27 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2018-12-30 16:10:36,218 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 578) the Hoare annotation is: (let ((.cse5 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26))) [2018-12-30 16:10:36,218 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 589) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13) (and .cse0 .cse1 .cse2 .cse4 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse3))) [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 452) no Hoare annotation was computed. [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 383) no Hoare annotation was computed. [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L543-2(lines 543 547) no Hoare annotation was computed. [2018-12-30 16:10:36,218 INFO L448 ceAbstractionStarter]: For program point L510-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 576) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 587) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 598) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L451 ceAbstractionStarter]: At program point L644(lines 635 646) the Hoare annotation is: true [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 616) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-12-30 16:10:36,219 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 575) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 586) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 216 218) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 597) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 483) no Hoare annotation was computed. [2018-12-30 16:10:36,220 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 576) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse26 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse25 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse21 .cse22 .cse23 .cse24 .cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)))) [2018-12-30 16:10:36,221 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 587) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2018-12-30 16:10:36,221 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. [2018-12-30 16:10:36,221 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2018-12-30 16:10:36,221 INFO L444 ceAbstractionStarter]: At program point L482(lines 72 633) the Hoare annotation is: false [2018-12-30 16:10:36,221 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 358) no Hoare annotation was computed. [2018-12-30 16:10:36,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:36,221 INFO L448 ceAbstractionStarter]: For program point $Ultimate##90(lines 208 567) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L444 ceAbstractionStarter]: At program point L351(lines 327 369) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2018-12-30 16:10:36,222 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 574) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L448 ceAbstractionStarter]: For program point $Ultimate##91(lines 208 567) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 585) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 596) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L448 ceAbstractionStarter]: For program point L418(lines 418 420) no Hoare annotation was computed. [2018-12-30 16:10:36,222 INFO L444 ceAbstractionStarter]: At program point L385(lines 376 408) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2018-12-30 16:10:36,222 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 597) the Hoare annotation is: (let ((.cse14 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse12))) [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 355) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 289) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L321-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 573) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 584) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 595) no Hoare annotation was computed. [2018-12-30 16:10:36,223 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 94) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 72 633) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 559) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 523) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 553 559) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 406) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:36,224 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 574) the Hoare annotation is: (let ((.cse25 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse26 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse20 .cse21 .cse22 .cse23 .cse24 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2018-12-30 16:10:36,225 INFO L444 ceAbstractionStarter]: At program point L157(lines 153 585) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2018-12-30 16:10:36,225 INFO L444 ceAbstractionStarter]: At program point L124(lines 123 595) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 395) no Hoare annotation was computed. [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 493) no Hoare annotation was computed. [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 572) no Hoare annotation was computed. [2018-12-30 16:10:36,225 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 583) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 594) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L451 ceAbstractionStarter]: At program point L622(lines 98 623) the Hoare annotation is: true [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 459) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L226-2(lines 208 565) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2018-12-30 16:10:36,226 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 426 434) no Hoare annotation was computed. [2018-12-30 16:10:36,227 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 231) no Hoare annotation was computed. [2018-12-30 16:10:36,227 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 571) no Hoare annotation was computed. [2018-12-30 16:10:36,227 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 582) no Hoare annotation was computed. [2018-12-30 16:10:36,227 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 593) no Hoare annotation was computed. [2018-12-30 16:10:36,227 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 572) the Hoare annotation is: (let ((.cse27 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse25 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse26 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse22 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse23 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse24 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse24) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2018-12-30 16:10:36,227 INFO L444 ceAbstractionStarter]: At program point L163(lines 159 583) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse5 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse6 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14))) [2018-12-30 16:10:36,229 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 629) no Hoare annotation was computed. [2018-12-30 16:10:36,229 INFO L448 ceAbstractionStarter]: For program point L627-2(lines 627 629) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 538) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 432) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 368) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 570) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 581) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 592) no Hoare annotation was computed. [2018-12-30 16:10:36,230 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 621) the Hoare annotation is: (let ((.cse6 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse21 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4)) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8609 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8641 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse20 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse14 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse22 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse23 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (and (and .cse21 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse21 .cse1) (and .cse2 .cse3 .cse4 .cse5 (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 .cse8 .cse9 (not (= 8592 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 .cse13 (not (= 8608 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1) (and .cse22 .cse20 .cse23 .cse14) (and .cse0 .cse22 .cse23))) [2018-12-30 16:10:36,231 INFO L444 ceAbstractionStarter]: At program point L397(lines 388 406) the Hoare annotation is: (let ((.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0) .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13))) [2018-12-30 16:10:36,240 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 235) no Hoare annotation was computed. [2018-12-30 16:10:36,240 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 581) the Hoare annotation is: (let ((.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2018-12-30 16:10:36,240 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 594) the Hoare annotation is: (let ((.cse15 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8529 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= ULTIMATE.start_ssl3_accept_~blastFlag~0 4) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2018-12-30 16:10:36,243 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:10:36,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:36 BoogieIcfgContainer [2018-12-30 16:10:36,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:36,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:36,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:36,364 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:36,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:09:41" (3/4) ... [2018-12-30 16:10:36,372 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:36,402 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 16:10:36,403 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:36,579 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:36,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:36,581 INFO L168 Benchmark]: Toolchain (without parser) took 57648.27 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 943.3 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 77.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,584 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:36,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 925.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,585 INFO L168 Benchmark]: Boogie Preprocessor took 47.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:36,585 INFO L168 Benchmark]: RCFGBuilder took 1431.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,588 INFO L168 Benchmark]: TraceAbstraction took 55198.28 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,588 INFO L168 Benchmark]: Witness Printer took 215.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:36,594 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.67 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 925.9 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1431.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55198.28 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -983.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 215.88 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 631]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((8448 <= s__state && s__state <= 8448) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 3) || (((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((blastFlag <= 2 && 8448 <= s__state) && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8576 == s__state)) && s__s3__tmp__next_state___0 <= 3) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8544 == s__state)) && !(8545 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__hit == 0)) || ((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || s__state <= 3) || (((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((blastFlag == 4 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (blastFlag == 4 && !(s__hit == 0))) || ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 3) && s__state <= 8576) && 0 == s__hit)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && s__state <= 8576)) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || ((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || ((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && 8448 <= s__state) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((8448 <= s__state && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576)) || ((((((((((((((blastFlag <= 2 && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((!(8528 == s__state) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__hit == 0)) || ((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || s__state <= 3) || (((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && 8448 <= s__state) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8577 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((blastFlag == 4 && s__s3__tmp__next_state___0 <= 3) && 8448 <= s__state) && s__state <= 8448)) || (blastFlag == 4 && !(s__hit == 0))) || ((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8657 == s__state)) && !(8640 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 3) && s__state <= 8576) && 0 == s__hit)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0))) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8657 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8656 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(8640 == s__state) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || ((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8480 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && blastFlag == 4) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576)) || ((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && s__state <= 8576) && !(s__hit == 0))) || (((((((((((((((!(8497 == s__state) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && 0 == s__hit) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && s__state <= 8576) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && blastFlag == 4) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3) && !(s__hit == 0))) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && 8448 <= s__state) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state))) || (((((((((((((((((((((((((!(8497 == s__state) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && 8448 <= s__state) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && blastFlag == 3)) || (((((((((((((((((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8609 == s__state)) && !(8593 == s__state)) && !(8640 == s__state)) && !(8496 == s__state)) && !(8528 == s__state)) && !(8512 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8641 == s__state)) && !(8673 == s__state)) && !(8592 == s__state)) && !(8577 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(12292 == s__state)) && !(8608 == s__state)) && !(8448 == s__state)) && !(8576 == s__state)) && !(8529 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(s__hit == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. SAFE Result, 55.0s OverallTime, 34 OverallIterations, 33 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 25.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5960 SDtfs, 5473 SDslu, 2362 SDs, 0 SdLazy, 3455 SolverSat, 1364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3636occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 278 NumberOfFragments, 6789 HoareAnnotationTreeSize, 28 FomulaSimplifications, 68259 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 11297 FormulaSimplificationTreeSizeReductionInter, 23.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 7442 NumberOfCodeBlocks, 7442 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7406 ConstructedInterpolants, 0 QuantifiedInterpolants, 4654246 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1332 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 36814/36866 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...